projects / cl-graph.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 91e1eb9) | patch
Improved efficiency of edge-count for graphs in general (from (length (graph-edges...
authorGary King <gwking@metabang.com>
Thu, 27 Apr 2006 13:35:21 +0000 (09:35 -0400)
committerGary King <gwking@metabang.com>
Thu, 27 Apr 2006 13:35:21 +0000 (09:35 -0400)
commit5282d117ab0e8b7080bca9683e270f0d2a8f4d5c
treee6ff66fe8d6027c521af3700e1bcdd011e78c72btree | snapshot
parent91e1eb9bf83e879fff123c9a7863ef52a0d406aecommit | diff
Improved efficiency of edge-count for graphs in general (from (length (graph-edges ...)) to (count-using ...)) and for graph-containers in particular (just use size).

darcs-hash:20060427133521-3cc5d-07b4bcedb22efc1e6badfcc16c3b9c9e76d44fa1.gz
dev/graph-container.lisp diff | blob | history
dev/graph.lisp diff | blob | history
Common Lisp library for manipulating graphs and running graph algorithms