1 ;;;-*- Mode: Lisp; Package: COMMON-LISP-USER -*-
5 Author: Gary King, et. al.
10 (in-package #:common-lisp-user)
12 (defpackage #:cl-graph
13 (:use #:common-lisp #:metatilities #:cl-containers)
14 (:nicknames #:metabang.graph)
15 (:documentation "CL-Graph is a Common Lisp library for manipulating graphs and running graph algorithms.")
18 #:with-changing-vertex
23 #:add-edge-between-vertexes ; graph { value | vertex } { value | vertex }
24 #:delete-edge-between-vertexes ; graph { value | vertex } { value | vertex }
25 #:add-vertex ; graph { value | vertex }
26 #:find-vertex ; graph { value | vertex }
27 #:find-edge ; graph edge
28 #:find-edge-between-vertexes ; graph { vertex | value } { vertex | value }
33 #:iterate-container ; graph fn
44 #:vertex-count ; graph
45 #:source-edge-count ; vertex
46 #:target-edge-count ; vertex
51 #:topological-sort ; graph
52 #:depth ; graph | vertex
55 #:get-transitive-closure ;; CTM
56 #:make-filtered-graph ;; CTM
59 #:in-cycle-p ; graph vertex
65 #:generate-directed-free-tree
67 #:contains-undirected-edge-p
68 #:contains-directed-edge-p
79 #:graph->dot-properties
86 #:layout-graph-with-graphviz
90 #:find-connected-components
91 #:connected-component-count
96 #:add-edge ; graph edge
97 #:delete-edge ; graph edge
100 #:add-vertex ; graph { value | vertex }
101 #:delete-vertex ; graph { value | vertex }
102 #:find-vertex ; graph { value | vertex }
103 #:find-edge ; graph edge
104 #:find-edge-between-vertexes ; graph { vertex | value } { vertex | value }
105 #:find-edge-between-vertexes-if ; graph { vertex | value } { vertex | value } fn
106 #:find-edge-if ; graph
107 #:find-edges-if ; graph
109 #:edges ; graph | vertex
110 #:iterate-edges ; graph fn
111 #:iterate-source-edges ; vertex fn
112 #:iterate-target-edges ; vertex fn
113 #:iterate-children ; vertex (nodes) fn
114 #:iterate-parents ; vertex (nodes) fn
115 #:iterate-neighbors ; vertex (all neighbors) fn
118 #:number-of-neighbors
123 #:vertex-count ; graph
125 #:topological-sort ; graph
126 #:depth ; graph | vertex
129 #:get-transitive-closure ;; CTM
130 #:make-filtered-graph ;; CTM
133 #:in-cycle-p ; graph vertex
134 #:in-undirected-cycle-p ; graph vertex
135 #:any-undirected-cycle-p ; graph
137 #:vertices-share-edge-p
142 ;;; depth first search
146 #:edge-lessp-by-direction
147 #:out-edge-for-vertex-p
150 ;;; minimum-spanning-tree
151 #+Ignore #:add-edges-to-graph
153 #:make-graph-from-vertexes
154 #:edge-lessp-by-weight
155 #:minimum-spanning-tree
158 #+Ignore #:map-over-all-combinations-of-k-vertexes
159 #+Ignore #:map-over-all-combinations-of-k-edges
161 #:project-bipartite-graph
163 #:make-vertex-edges-container
164 #:make-vertex-for-graph
166 #:vertex-degree-counts
168 #:average-vertex-degree
169 #:vertex-clustering-coefficient
170 #:average-vertex-clustering-coefficient
172 #:graph-mixing-matrix
173 #:graph-edge-mixture-matrix
174 #:assortativity-coefficient
175 #:vertex-degree-summary
176 #:connected-components
177 #:average-local-clustering-coefficient
178 #:vertex-triangle-count
183 #:print-dot-key-value
184 #:dot-attribute-value
185 #:dot-attributes-mixin
186 #:*dot-graph-attributes*