A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.
30 Day SummaryFeb 5 2020 — Mar 6 2020
|
12 Month SummaryMar 6 2019 — Mar 6 2020
|