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
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
87 #:layout-graph-with-graphviz
91 #:find-connected-components
92 #:connected-component-count
97 #:add-edge ; graph edge
98 #:delete-edge ; graph edge
101 #:add-vertex ; graph { value | vertex }
102 #:delete-vertex ; graph { value | vertex }
103 #:find-vertex ; graph { value | vertex }
104 #:find-edge ; graph edge
105 #:find-edge-between-vertexes ; graph { vertex | value } { vertex | value }
106 #:find-edge-between-vertexes-if ; graph { vertex | value } { vertex | value } fn
107 #:find-edge-if ; graph
108 #:find-edges-if ; graph
110 #:edges ; graph | vertex
111 #:iterate-edges ; graph fn
112 #:iterate-source-edges ; vertex fn
113 #:iterate-target-edges ; vertex fn
114 #:iterate-children ; vertex (nodes) fn
115 #:iterate-parents ; vertex (nodes) fn
116 #:iterate-neighbors ; vertex (all neighbors) fn
119 #:number-of-neighbors
122 #:vertex-count ; graph
124 #:topological-sort ; graph
125 #:depth ; graph | vertex
128 #:get-transitive-closure ;; CTM
129 #:make-filtered-graph ;; CTM
132 #:in-cycle-p ; graph vertex
133 #:in-undirected-cycle-p ; graph vertex
134 #:any-undirected-cycle-p ; graph
136 #:vertices-share-edge-p
141 ;;; depth first search
145 #:edge-lessp-by-direction
146 #:out-edge-for-vertex-p
149 ;;; minimum-spanning-tree
150 #+Ignore #:add-edges-to-graph
152 #:make-graph-from-vertexes
153 #:edge-lessp-by-weight
154 #:minimum-spanning-tree
157 #+Ignore #:map-over-all-combinations-of-k-vertexes
158 #+Ignore #:map-over-all-combinations-of-k-edges
160 #:project-bipartite-graph
162 #:make-vertex-edges-container
164 #:vertex-degree-counts
166 #:average-vertex-degree
167 #:vertex-clustering-coefficient
168 #:average-vertex-clustering-coefficient
170 #:graph-mixing-matrix
171 #:graph-edge-mixture-matrix
172 #:assortativity-coefficient
173 #:vertex-degree-summary)
176 #:print-dot-key-value
177 #:dot-attribute-value
178 #:dot-attributes-mixin
179 #:*dot-graph-attributes*