A package for creating and manipulating graphs (in the graph-theoretic sense). Creates a set of CLOS classes for graphs, vertices, edges. Provides algorithms for traversing, counting, searching for vertices.
|Version||0.10.2 - Sunday, 26 October 2008|
|OS compatibility||OS X, Linux (for sure), others unknown.|
|Source code repository||http://common-lisp.net/project/cl-graph/darcs/cl-graph|
CL-Graph is a Common Lisp library for manipulating graphs and running graph algorithms. Graphs are collections of vertex sets, edge sets, not X-Y plots or pie charts. CL-Graph uses the Metaobject Protocol to define CLOS classes for graphs, vertices, edges, and provides functions for traversing, searching, and counting.
There are two mailing lists:
The package is asdf-installable, and a Darcs repository is available (note that you'll also need to get several other bits and pieces to get CL-Graph to work). The commands are listed below:
darcs get http://common-lisp.net/project/cl-graph/darcs/cl-graph darcs get http://common-lisp.net/project/cl-mathstats/darcs/cl-mathstats darcs get http://common-lisp.net/project/cl-containers/metabang.bind/darcs/metabang.bind darcs get http://common-lisp.net/project/cl-containers/metatilities/darcs/metatilities darcs get http://common-lisp.net/project/cl-containers/moptilities/darcs/moptilities
You must be logged to add a note
You must be logged to add a comment