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 "METABANG.BIND" "METABANG.MATH")
15 (:nicknames "METABANG.GRAPH")
16 (:documentation "CL-Graph is a Common Lisp library for manipulating graphs and running graph algorithms.")
19 #:with-changing-vertex
24 #:add-edge-between-vertexes ; graph { value | vertex } { value | vertex }
25 #:delete-edge-between-vertexes ; graph { value | vertex } { value | vertex }
26 #:add-vertex ; graph { value | vertex }
27 #:find-vertex ; graph { value | vertex }
28 #:find-edge ; graph edge
29 #:find-edge-between-vertexes ; graph { vertex | value } { vertex | value }
34 #:iterate-container ; graph fn
45 #:vertex-count ; graph
46 #:source-edge-count ; vertex
47 #:target-edge-count ; vertex
52 #:topological-sort ; graph
53 #:depth ; graph | vertex
56 #:get-transitive-closure ;; CTM
57 #:make-filtered-graph ;; CTM
60 #:in-cycle-p ; graph vertex
66 #:generate-directed-free-tree
68 #:contains-undirected-edge-p
69 #:contains-directed-edge-p
80 #:graph->dot-properties
84 #:find-connected-components
85 #:connected-component-count
90 #:add-edge ; graph edge
91 #:delete-edge ; graph edge
93 #:add-vertex ; graph { value | vertex }
94 #:delete-vertex ; graph { value | vertex }
95 #:find-vertex ; graph { value | vertex }
96 #:find-edge ; graph edge
97 #:find-edge-between-vertexes ; graph { vertex | value } { vertex | value }
98 #:find-edge-between-vertexes-if ; graph { vertex | value } { vertex | value } fn
99 #:find-edge-if ; graph
100 #:find-edges-if ; graph
102 #:edges ; graph | vertex
103 #:iterate-edges ; graph fn
104 #:iterate-source-edges ; vertex fn
105 #:iterate-target-edges ; vertex fn
106 #:iterate-children ; vertex (nodes) fn
107 #:iterate-parents ; vertex (nodes) fn
108 #:iterate-neighbors ; vertex (all neighbors) fn
111 #:number-of-neighbors
114 #:vertex-count ; graph
116 #:topological-sort ; graph
117 #:depth ; graph | vertex
120 #:get-transitive-closure ;; CTM
121 #:make-filtered-graph ;; CTM
124 #:in-cycle-p ; graph vertex
125 #:in-undirected-cycle-p ; graph vertex
126 #:any-undirected-cycle-p ; graph
128 #:vertices-share-edge-p
133 ;;; depth first search
137 #:edge-lessp-by-direction
138 #:out-edge-for-vertex-p
141 ;;; minimum-spanning-tree
142 #+Ignore #:add-edges-to-graph
144 #:make-graph-from-vertexes
145 #:edge-lessp-by-weight
146 #:minimum-spanning-tree
149 #+Ignore #:map-over-all-combinations-of-k-vertexes
150 #+Ignore #:map-over-all-combinations-of-k-edges
152 #:project-bipartite-graph
154 #:make-vertex-edges-container
156 #:vertex-degree-counts
158 #:average-vertex-degree
159 #:vertex-clustering-coefficient
160 #:average-vertex-clustering-coefficient
162 #:graph-mixing-matrix
163 #:graph-edge-mixture-matrix
164 #:assortativity-coefficient
165 #:vertex-degree-summary))