1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
(defpackage #:graph
(:use :common-lisp :alexandria :metabang-bind :curry-compose-reader-macros)
(:export
:graph
:digraph
:copy
:digraph-of
:graph-of
:populate
:graph-equal
;; Serialization
:to-plist
:from-plist
:to-adjacency-matrix
:to-value-matrix
:from-value-matrix
;; Simple Graph Methods
:edges
:edges-w-values
:nodes
:nodes-w-values
:has-node-p
:has-edge-p
:subgraph
:add-node
:add-edge
:node-edges
:degree
:indegree
:outdegree
:delete-node
:edge-value
:delete-edge
:reverse-edges
;; Complex Graph Methods
:merge-nodes
:merge-edges
:edge-neighbors
:neighbors
:precedents
:connected-component
:connectedp
:connected-components
:topological-sort
:levels
;; Cycles and strongly connected components
:strongly-connected-components
:basic-cycles
:cycles
:minimum-spanning-tree
:connected-groups-of-size
:closedp
:clustering-coefficient
:cliques
;; Shortest Path
:shortest-path
;; Max Flow
:residual
:add-paths
:max-flow
;; Min Cut
:min-cut
;; Random Graph generation
:preferential-attachment-populate
:erdos-renyi-populate
:erdos-renyi-graph
:erdos-renyi-digraph
:edgar-gilbert-populate
:edgar-gilbert-graph
:edgar-gilbert-digraph
;; Centrality
:farness
:closeness
:betweenness
:katz-centrality
;; Degeneracy
:degeneracy
:k-cores))
|
