This is the com.danielkeogh.graph Reference Manual, version 0.0.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 05:47:48 2024 GMT+0.
com.danielkeogh.graph/com.danielkeogh.graph.asdcom.danielkeogh.graph/utils.lispcom.danielkeogh.graph/structures/edge.lispcom.danielkeogh.graph/structures/adjacency.lispcom.danielkeogh.graph/structures/bidirectional.lispcom.danielkeogh.graph/structures/bidirectional-matrix.lispcom.danielkeogh.graph/structures/undirected.lispcom.danielkeogh.graph/api.lispcom.danielkeogh.graph/algorithms/package.lispcom.danielkeogh.graph/algorithms/hungarian-assignment.lispcom.danielkeogh.graph/algorithms/bidirectional-breadth-first-search.lispcom.danielkeogh.graph/algorithms/breadth-first-search.lispcom.danielkeogh.graph/algorithms/depth-first-search.lispcom.danielkeogh.graph/algorithms/strongly-connected-components.lispcom.danielkeogh.graph/algorithms/weakly-connected-components.lispcom.danielkeogh.graph/algorithms/connected-components-utils.lispcom.danielkeogh.graph/algorithms/condensate-vertices.lispcom.danielkeogh.graph/algorithms/kernighan-lin.lispcom.danielkeogh.graph/algorithms/minimum-spanning-tree.lispThe main system appears first, followed by any subsystem dependency.
com.danielkeogh.graphA fast an reliable graph library.
Daniel Keogh
MIT
0.0.1
alexandria (system).
cl-speedy-queue (system).
trivial-indent (system).
utils.lisp (file).
structures (module).
api.lisp (file).
algorithms (module).
Modules are listed depth-first from the system components tree.
com.danielkeogh.graph/structuresutils.lisp (file).
com.danielkeogh.graph (system).
edge.lisp (file).
adjacency.lisp (file).
bidirectional.lisp (file).
bidirectional-matrix.lisp (file).
undirected.lisp (file).
com.danielkeogh.graph/algorithmsstructures (module).
utils.lisp (file).
api.lisp (file).
com.danielkeogh.graph (system).
package.lisp (file).
hungarian-assignment.lisp (file).
bidirectional-breadth-first-search.lisp (file).
breadth-first-search.lisp (file).
depth-first-search.lisp (file).
strongly-connected-components.lisp (file).
weakly-connected-components.lisp (file).
connected-components-utils.lisp (file).
condensate-vertices.lisp (file).
kernighan-lin.lisp (file).
minimum-spanning-tree.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
com.danielkeogh.graph/com.danielkeogh.graph.asdcom.danielkeogh.graph/utils.lispcom.danielkeogh.graph/structures/edge.lispcom.danielkeogh.graph/structures/adjacency.lispcom.danielkeogh.graph/structures/bidirectional.lispcom.danielkeogh.graph/structures/bidirectional-matrix.lispcom.danielkeogh.graph/structures/undirected.lispcom.danielkeogh.graph/api.lispcom.danielkeogh.graph/algorithms/package.lispcom.danielkeogh.graph/algorithms/hungarian-assignment.lispcom.danielkeogh.graph/algorithms/bidirectional-breadth-first-search.lispcom.danielkeogh.graph/algorithms/breadth-first-search.lispcom.danielkeogh.graph/algorithms/depth-first-search.lispcom.danielkeogh.graph/algorithms/strongly-connected-components.lispcom.danielkeogh.graph/algorithms/weakly-connected-components.lispcom.danielkeogh.graph/algorithms/connected-components-utils.lispcom.danielkeogh.graph/algorithms/condensate-vertices.lispcom.danielkeogh.graph/algorithms/kernighan-lin.lispcom.danielkeogh.graph/algorithms/minimum-spanning-tree.lispcom.danielkeogh.graph/com.danielkeogh.graph.asdcom.danielkeogh.graph (system).
com.danielkeogh.graph/utils.lispcom.danielkeogh.graph (system).
*external-optimize-settings* (special variable).
*internal-optimize-settings* (special variable).
let-with-string-streams (macro).
required-argument (function).
with-collector (macro).
with-counter (macro).
with-maximizer (macro).
with-minimizer (macro).
com.danielkeogh.graph/structures/edge.lispstructures (module).
edge (structure).
edge-p (function).
edge-source (reader).
edge-target (reader).
make-edge (function).
print-object (method).
with-edge (macro).
copy-edge (function).
com.danielkeogh.graph/structures/adjacency.lispedge.lisp (file).
structures (module).
add-edge (function).
add-edge-between (function).
add-vertex (function).
adjacency-graph (structure).
adjacency-graph-p (function).
edge-count (function).
edges (function).
for-edges (function).
for-out-edges (function).
for-vertices (function).
graph-vertex-equality-fn (reader).
has-edge (function).
has-edge-between (function).
has-vertex (function).
in-edges (function).
make-graph (function).
out-edges (function).
remove-edge (function).
remove-edge-between (function).
remove-vertex (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-adjacency-graph (function).
edge-equal (function).
ensure-vertex (macro).
graph-allow-parallel-edges (reader).
graph-vertex-edges (reader).
make-adjacency-graph (function).
make-edge-list (function).
remove-in-edges (function).
com.danielkeogh.graph/structures/bidirectional.lispedge.lisp (file).
structures (module).
add-edge (function).
add-edge-between (function).
add-vertex (function).
bidirectional-graph (structure).
bidirectional-graph-p (function).
edge-count (function).
edges (function).
for-edges (function).
for-in-edges (function).
for-out-edges (function).
for-vertices (function).
graph-vertex-equality-fn (reader).
has-edge (function).
has-edge-between (function).
has-vertex (function).
in-edges (function).
make-graph (function).
out-edges (function).
remove-edge (function).
remove-edge-between (function).
remove-vertex (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-bidirectional-graph (function).
edge-equal (function).
ensure-vertex (macro).
for-in-out-edges (function).
graph-allow-parallel-edges (reader).
graph-vertex-in-edges (reader).
graph-vertex-out-edges (reader).
make-bidirectional-graph (function).
make-edge-list (function).
com.danielkeogh.graph/structures/bidirectional-matrix.lispedge.lisp (file).
structures (module).
add-edge (function).
add-edge-between (function).
bidirectional-matrix-graph (structure).
bidirectional-matrix-graph-p (function).
edge-count (function).
edges (function).
for-edges (function).
for-in-edges (function).
for-in-out-eges (function).
for-out-edges (function).
for-vertices (function).
graph-vertex-equality-fn (function).
has-edge (function).
has-edge-between (function).
has-vertex (function).
in-edges (function).
make-graph (function).
out-edges (function).
remove-edge (function).
remove-edge-between (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-bidirectional-matrix-graph (function).
graph-edge-count (reader).
(setf graph-edge-count) (writer).
graph-edges (reader).
graph-vertex-count (reader).
make-bidirectional-matrix-graph (function).
com.danielkeogh.graph/structures/undirected.lispedge.lisp (file).
structures (module).
add-edge (function).
add-edge-between (function).
add-vertex (function).
adjacent-edges (function).
edge-count (function).
edges (function).
for-edges (function).
for-vertices (function).
graph-vertex-equality-fn (reader).
has-edge (function).
has-edge-between (function).
has-vertex (function).
make-graph (function).
remove-edge (function).
remove-edge-between (function).
remove-vertex (function).
undirected-graph (structure).
undirected-graph-p (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-undirected-graph (function).
edge-equal (function).
ensure-vertex (macro).
for-adjacent-edges (function).
graph-allow-parallel-edges (reader).
graph-vertex-edges (reader).
make-edge-list (function).
make-undirected-graph (function).
com.danielkeogh.graph/api.lispstructures (module).
com.danielkeogh.graph (system).
add-edge (generic function).
add-edge* (function).
add-edge-between (generic function).
add-edges (function).
add-edges-and-vertices (function).
add-edges-and-vertices* (function).
add-edges-and-vertices-between (function).
add-edges-and-vertices-between* (function).
add-vertex (generic function).
add-vertex* (function).
add-vertices (function).
adjacent-edges (generic function).
edge-count (generic function).
edge-source (function).
edge-target (function).
edges (function).
for-edges (generic function).
for-in-out-edges (function).
for-roots (function).
for-vertices (generic function).
graph-equals (function).
graph-vertex-equality-fn (generic function).
has-edge (method).
has-edge (method).
has-edge (method).
has-edge (method).
has-edge-between (method).
has-edge-between (method).
has-edge-between (method).
has-edge-between (method).
has-vertex (generic function).
in-edges (generic function).
is-directed (generic function).
make-adjacency-graph (function).
make-bidirectional-graph (function).
make-bidirectional-matrix-graph (function).
make-edge (function).
make-undirected-graph (function).
out-edges (generic function).
pretty-print (function).
remove-edge (generic function).
remove-edge-between (generic function).
remove-vertex (method).
remove-vertex (method).
remove-vertex (method).
remove-vertex (method).
roots (function).
unsupported-generic (condition).
vertex-count (generic function).
vertex-equals (function).
vertices (function).
with-graph* (macro).
*graph* (special variable).
unsupported-generic-supported-by (reader method).
(setf unsupported-generic-supported-by) (writer method).
com.danielkeogh.graph/algorithms/package.lispalgorithms (module).
com.danielkeogh.graph/algorithms/hungarian-assignment.lisppackage.lisp (file).
algorithms (module).
com.danielkeogh.graph/algorithms/bidirectional-breadth-first-search.lisppackage.lisp (file).
algorithms (module).
bidirectional-breadth-first-search (function).
com.danielkeogh.graph/algorithms/breadth-first-search.lisppackage.lisp (file).
algorithms (module).
breadth-first-search (function).
com.danielkeogh.graph/algorithms/depth-first-search.lisppackage.lisp (file).
algorithms (module).
depth-first-search (function).
make-search-frame (function).
sf-depth (function).
sf-edges (function).
sf-vertex (function).
com.danielkeogh.graph/algorithms/strongly-connected-components.lisppackage.lisp (file).
depth-first-search.lisp (file).
algorithms (module).
strongly-connected-components (function).
com.danielkeogh.graph/algorithms/weakly-connected-components.lisppackage.lisp (file).
depth-first-search.lisp (file).
algorithms (module).
weakly-connected-components (function).
com.danielkeogh.graph/algorithms/connected-components-utils.lisppackage.lisp (file).
algorithms (module).
connected-components->graphs (function).
com.danielkeogh.graph/algorithms/condensate-vertices.lisppackage.lisp (file).
algorithms (module).
condensate-strongly-connected-vertices (function).
condensate-vertices (function).
condensed-edge (structure).
condensed-edge-edges (reader).
(setf condensed-edge-edges) (writer).
condensed-edge-p (function).
condensed-edge-source (function).
condensed-edge-target (function).
copy-condensed-edge (function).
make-condensed-edge (function).
com.danielkeogh.graph/algorithms/kernighan-lin.lisppackage.lisp (file).
algorithms (module).
kernighan-lin-partition (function).
com.danielkeogh.graph/algorithms/minimum-spanning-tree.lisppackage.lisp (file).
bidirectional-breadth-first-search.lisp (file).
algorithms (module).
minimum-spanning-tree (function).
copy-r-edge (function).
get-minimal-edges (function).
make-r-edge (function).
r-edge (structure).
r-edge-cost (reader).
(setf r-edge-cost) (writer).
r-edge-p (function).
r-edge-source (function).
r-edge-target (function).
r-edge-wrapped (reader).
(setf r-edge-wrapped) (writer).
Packages are listed by definition order.
com.danielkeogh.graph.bidirectional-matrixcom.danielkeogh.graph.utilscom.danielkeogh.graph.bidirectionalcom.danielkeogh.graph.algorithmscom.danielkeogh.graph.adjacencycom.danielkeogh.graph.undirectedcom.danielkeogh.graphcom.danielkeogh.graph.edgecom.danielkeogh.graph.bidirectional-matrixcommon-lisp.
add-edge (function).
add-edge-between (function).
bidirectional-matrix-graph (structure).
bidirectional-matrix-graph-p (function).
edge-count (function).
edges (function).
for-edges (function).
for-in-edges (function).
for-in-out-eges (function).
for-out-edges (function).
for-vertices (function).
graph-vertex-equality-fn (function).
has-edge (function).
has-edge-between (function).
has-vertex (function).
in-edges (function).
make-graph (function).
out-edges (function).
remove-edge (function).
remove-edge-between (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-bidirectional-matrix-graph (function).
graph-edge-count (reader).
(setf graph-edge-count) (writer).
graph-edges (reader).
graph-vertex-count (reader).
make-bidirectional-matrix-graph (function).
com.danielkeogh.graph.utilscommon-lisp.
*external-optimize-settings* (special variable).
*internal-optimize-settings* (special variable).
let-with-string-streams (macro).
required-argument (function).
with-collector (macro).
with-counter (macro).
with-maximizer (macro).
with-minimizer (macro).
com.danielkeogh.graph.bidirectionalcommon-lisp.
add-edge (function).
add-edge-between (function).
add-vertex (function).
bidirectional-graph (structure).
bidirectional-graph-p (function).
edge-count (function).
edges (function).
for-edges (function).
for-in-edges (function).
for-out-edges (function).
for-vertices (function).
graph-vertex-equality-fn (reader).
has-edge (function).
has-edge-between (function).
has-vertex (function).
in-edges (function).
make-graph (function).
out-edges (function).
remove-edge (function).
remove-edge-between (function).
remove-vertex (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-bidirectional-graph (function).
edge-equal (function).
ensure-vertex (macro).
for-in-out-edges (function).
graph-allow-parallel-edges (reader).
graph-vertex-in-edges (reader).
graph-vertex-out-edges (reader).
make-bidirectional-graph (function).
make-edge-list (function).
com.danielkeogh.graph.algorithmscommon-lisp.
bidirectional-breadth-first-search (function).
breadth-first-search (function).
condensate-strongly-connected-vertices (function).
condensate-vertices (function).
connected-components->graphs (function).
depth-first-search (function).
kernighan-lin-partition (function).
minimum-spanning-tree (function).
strongly-connected-components (function).
weakly-connected-components (function).
condensed-edge (structure).
condensed-edge-edges (reader).
(setf condensed-edge-edges) (writer).
condensed-edge-p (function).
condensed-edge-source (function).
condensed-edge-target (function).
copy-condensed-edge (function).
copy-r-edge (function).
copy-search-frame (function).
get-minimal-edges (function).
make-condensed-edge (function).
make-r-edge (function).
make-search-frame (function).
r-edge (structure).
r-edge-cost (reader).
(setf r-edge-cost) (writer).
r-edge-p (function).
r-edge-source (function).
r-edge-target (function).
r-edge-wrapped (reader).
(setf r-edge-wrapped) (writer).
sf-depth (function).
sf-edges (function).
sf-vertex (function).
com.danielkeogh.graph.adjacencycommon-lisp.
add-edge (function).
add-edge-between (function).
add-vertex (function).
adjacency-graph (structure).
adjacency-graph-p (function).
edge-count (function).
edges (function).
for-edges (function).
for-out-edges (function).
for-vertices (function).
graph-vertex-equality-fn (reader).
has-edge (function).
has-edge-between (function).
has-vertex (function).
in-edges (function).
make-graph (function).
out-edges (function).
remove-edge (function).
remove-edge-between (function).
remove-vertex (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-adjacency-graph (function).
edge-equal (function).
ensure-vertex (macro).
graph-allow-parallel-edges (reader).
graph-vertex-edges (reader).
make-adjacency-graph (function).
make-edge-list (function).
remove-in-edges (function).
com.danielkeogh.graph.undirectedcommon-lisp.
add-edge (function).
add-edge-between (function).
add-vertex (function).
adjacent-edges (function).
edge-count (function).
edges (function).
for-edges (function).
for-vertices (function).
graph-vertex-equality-fn (reader).
has-edge (function).
has-edge-between (function).
has-vertex (function).
make-graph (function).
remove-edge (function).
remove-edge-between (function).
remove-vertex (function).
undirected-graph (structure).
undirected-graph-p (function).
vertex-count (function).
vertices (function).
%add-edge (function).
copy-undirected-graph (function).
edge-equal (function).
ensure-vertex (macro).
for-adjacent-edges (function).
graph-allow-parallel-edges (reader).
graph-vertex-edges (reader).
make-edge-list (function).
make-undirected-graph (function).
com.danielkeogh.graphcommon-lisp.
add-edge (generic function).
add-edge* (function).
add-edge-between (generic function).
add-edges (function).
add-edges-and-vertices (function).
add-edges-and-vertices* (function).
add-edges-and-vertices-between (function).
add-edges-and-vertices-between* (function).
add-vertex (generic function).
add-vertex* (function).
add-vertices (function).
adjacent-edges (generic function).
edge-count (generic function).
edge-source (function).
edge-target (function).
edges (function).
for-edges (generic function).
for-in-out-edges (function).
for-roots (function).
for-vertices (generic function).
graph-equals (function).
graph-vertex-equality-fn (generic function).
has-edge (generic function).
has-edge-between (generic function).
has-vertex (generic function).
in-edges (generic function).
is-directed (generic function).
make-adjacency-graph (function).
make-bidirectional-graph (function).
make-bidirectional-matrix-graph (function).
make-edge (function).
make-undirected-graph (function).
out-edges (generic function).
pretty-print (function).
remove-edge (generic function).
remove-edge-between (generic function).
remove-vertex (generic function).
roots (function).
unsupported-generic (condition).
vertex-count (generic function).
vertex-equals (function).
vertices (function).
with-graph* (macro).
*graph* (special variable).
unsupported-generic-supported-by (generic reader).
(setf unsupported-generic-supported-by) (generic writer).
com.danielkeogh.graph.edgecommon-lisp.
edge (structure).
edge-p (function).
edge-source (reader).
edge-target (reader).
make-edge (function).
with-edge (macro).
copy-edge (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Creating a bunch of nested ‘with-output-to-string‘ and then binding them to separate variables is a pain.
This macro takes that pain away! You can use it like this:
“‘
(utils:let-with-string-streams (s1 s2)
(progn (princ "foo" s1)
(princ "bar" s2))
(values s1 s2))
“‘
Collect a list
Count
Set the dynamic variable *graph* for use in dynamic builder functions.
Find the maximum
Find the minimum
Add an edge to *graph*.
Add a set of edges to a graph.
Add a collection of edges to the graph, ensuring that their vertices are also added.
Add a set of edges to *graph*, ensuring that their vertices are also added.
Convert a p-list into a set of edges and add all of these edges to a graph, ensuring their vertices are also added.
Convert a p-list into a set of edges and add all of these edges to *graph*, ensuring their vertices are also added.
Add a vertex to *graph*.
Add a set of vertices to a graph.
Find the source vertex of an edge. For undirected graphs the orientation is arbitrary.
Find the target vertex of an edge. For undirected graphs the orientation is arbitrary.
Get all edges in the graph as a list.
Apply a function ‘fn‘ to each edge to and from a vertex in a directed graph.
Call a function on all vertices with no inbound edges.
Check if two graphs contain the same sets of edges and vertices.
Create a directed graph optimized for ‘out-edges‘ access.
Create a directed graph optimized for ‘out-edges‘ and ‘in-edges‘ access.
Create a graph with pre-populated vertices optimized for checking if a given edge exists. Vertices are represented as ‘fixnum‘ from 0 below ‘vertex-count‘.
Create an edge between two vertices. This edge may be used in both directed and undirected graphs.
Create an undirected graph optimized for finding edges of a given vertex quickly.
Find the set of edges in the graph that make up a minimum spanning tree (MST).
Print the set of vertices and edges in a graph.
Get all vertices with no inbound edges.
Check if two vertices are considered equal in a graph.
Get all verticies in the graph as a list.
Add an edge to a graph. Will error if the edge refers to a vertex that is not yet added to the graph.
undirected-graph) edge) ¶bidirectional-matrix-graph) edge) ¶bidirectional-graph) edge) ¶adjacency-graph) edge) ¶Create a new edge between two vertices on a graph. Will error if the edge refers to a vertex that is not yet added to the graph.
undirected-graph) vertex1 vertex2) ¶bidirectional-matrix-graph) vertex1 vertex2) ¶bidirectional-graph) vertex1 vertex2) ¶adjacency-graph) vertex1 vertex2) ¶Add a vertex to a graph.
undirected-graph) vertex) ¶bidirectional-matrix-graph) vertex) ¶bidirectional-graph) vertex) ¶adjacency-graph) vertex) ¶Get adjacent edges for a given vertex. Only supported for undirected graphs.
undirected-graph) vertex) ¶Total count of edges in the graph.
undirected-graph)) ¶bidirectional-matrix-graph)) ¶bidirectional-graph)) ¶adjacency-graph)) ¶Apply a function to all edges in the graph.
undirected-graph) fn) ¶bidirectional-matrix-graph) fn) ¶bidirectional-graph) fn) ¶adjacency-graph) fn) ¶Apply a function to all verticies in the graph.
undirected-graph) fn) ¶bidirectional-matrix-graph) fn) ¶bidirectional-graph) fn) ¶adjacency-graph) fn) ¶Get the function that checks if two vertices in the graph are the same.
undirected-graph)) ¶bidirectional-matrix-graph)) ¶bidirectional-graph)) ¶adjacency-graph)) ¶undirected-graph) edge) ¶bidirectional-matrix-graph) edge) ¶bidirectional-graph) edge) ¶adjacency-graph) edge) ¶undirected-graph) source target) ¶bidirectional-matrix-graph) source target) ¶bidirectional-graph) source target) ¶adjacency-graph) source target) ¶See if the vertex has been added.
undirected-graph) vertex) ¶bidirectional-matrix-graph) vertex) ¶bidirectional-graph) vertex) ¶adjacency-graph) vertex) ¶Get inbound edges for a given vertex. Only supported for directed graphs.
bidirectional-matrix-graph) vertex) ¶bidirectional-graph) vertex) ¶adjacency-graph) vertex) ¶Check if a graph is directed.
undirected-graph)) ¶bidirectional-matrix-graph)) ¶bidirectional-graph)) ¶adjacency-graph)) ¶Get outbound edges for a given vertex. Only supported for directed graphs.
bidirectional-matrix-graph) vertex) ¶bidirectional-graph) vertex) ¶adjacency-graph) vertex) ¶Remove all edges edge between two vertexes.
undirected-graph) edge) ¶bidirectional-matrix-graph) edge) ¶bidirectional-graph) edge) ¶adjacency-graph) edge) ¶Remove all edges edge between two vertexes.
undirected-graph) vertex1 vertex2) ¶bidirectional-matrix-graph) vertex1 vertex2) ¶bidirectional-graph) vertex1 vertex2) ¶adjacency-graph) vertex1 vertex2) ¶undirected-graph) vertex) ¶bidirectional-matrix-graph) vertex) ¶bidirectional-graph) vertex) ¶adjacency-graph) vertex) ¶Total count of vertexes in the graph.
undirected-graph)) ¶bidirectional-matrix-graph)) ¶bidirectional-graph)) ¶adjacency-graph)) ¶This graph cannot support this generic.
error.
:supported-by
structure-object.
boolean
(com.danielkeogh.graph.utils:required-argument "allow-parallel-edges")
This slot is read-only.
hash-table
(com.danielkeogh.graph.utils:required-argument "vertex-edges")
This slot is read-only.
function
(com.danielkeogh.graph.utils:required-argument "vertex-equality-fn")
This slot is read-only.
structure-object.
boolean
(com.danielkeogh.graph.utils:required-argument "allow-parallel-edges")
This slot is read-only.
hash-table
(com.danielkeogh.graph.utils:required-argument "vertex-in-edges")
This slot is read-only.
hash-table
(com.danielkeogh.graph.utils:required-argument "vertex-out-edges")
This slot is read-only.
function
(com.danielkeogh.graph.utils:required-argument "vertex-equality-fn")
This slot is read-only.
structure-object.
fixnum
(com.danielkeogh.graph.utils:required-argument "vertex-count")
This slot is read-only.
fixnum
0
(simple-array (or null com.danielkeogh.graph.edge:edge) (* *))
(com.danielkeogh.graph.utils:required-argument "edges")
This slot is read-only.
structure-object.
(not null)
(com.danielkeogh.graph.utils:required-argument "source")
This slot is read-only.
(not null)
(com.danielkeogh.graph.utils:required-argument "target")
This slot is read-only.
structure-object.
boolean
(com.danielkeogh.graph.utils:required-argument "allow-parallel-edges")
This slot is read-only.
hash-table
(com.danielkeogh.graph.utils:required-argument "vertex-edges")
This slot is read-only.
function
(com.danielkeogh.graph.utils:required-argument "vertex-equality-fn")
This slot is read-only.
Return a copy of SEQUENCE which is EQUAL to SEQUENCE but not EQ.
copy-seq.
cost.
unsupported-generic)) ¶unsupported-generic)) ¶| Jump to: | %
(
A B C D E F G H I K L M O P R S U V W |
|---|
| Jump to: | %
(
A B C D E F G H I K L M O P R S U V W |
|---|
| Jump to: | *
A C E S T V W |
|---|
| Jump to: | *
A C E S T V W |
|---|
| Jump to: | A B C D E F H K M P R S U W |
|---|
| Jump to: | A B C D E F H K M P R S U W |
|---|