The cl-graph Reference Manual

Table of Contents

Next: , Previous: , Up: (dir)   [Contents][Index]

The cl-graph Reference Manual

This is the cl-graph Reference Manual, version 0.10.2, generated automatically by Declt version 2.3 "Robert April" on Wed Mar 14 03:20:34 2018 GMT+0.


Next: , Previous: , Up: Top   [Contents][Index]

1 Systems

The main system appears first, followed by any subsystem dependency.


Previous: , Up: Systems   [Contents][Index]

1.1 cl-graph

Maintainer

Gary Warren King <gwking@metabang.com>

Author

Gary Warren King <gwking@metabang.com>

License

MIT Style License

Description

Graph manipulation utilities for Common Lisp

Version

0.10.2

Dependencies
Source

cl-graph.asd (file)

Components

Next: , Previous: , Up: Top   [Contents][Index]

2 Modules

Modules are listed depth-first from the system components tree.


Next: , Previous: , Up: Modules   [Contents][Index]

2.1 cl-graph/dev

Parent

cl-graph (system)

Location

dev/

Components

Next: , Previous: , Up: Modules   [Contents][Index]

2.2 cl-graph/dev/graphviz

Dependency

graph.lisp (file)

Parent

dev (module)

Location

dev/graphviz/

Component

graphviz-support.lisp (file)


Next: , Previous: , Up: Modules   [Contents][Index]

2.3 cl-graph/website

Parent

cl-graph (system)

Location

website/

Component

source (module)


Previous: , Up: Modules   [Contents][Index]

2.4 cl-graph/website/source

Parent

website (module)

Location

website/source/

Component

index.mmd (file)


Next: , Previous: , Up: Top   [Contents][Index]

3 Files

Files are sorted by type and then listed depth-first from the systems components trees.


Next: , Previous: , Up: Files   [Contents][Index]

3.1 Lisp


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.1 cl-graph.asd

Location

cl-graph.asd

Systems

cl-graph (system)


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.2 cl-graph/dev/package.lisp

Parent

dev (module)

Location

dev/package.lisp

Packages

cl-graph


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.3 cl-graph/dev/api.lisp

Dependency

package.lisp (file)

Parent

dev (module)

Location

dev/api.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.4 cl-graph/dev/macros.lisp

Dependency

package.lisp (file)

Parent

dev (module)

Location

dev/macros.lisp

Exported Definitions

with-changing-vertex (macro)


Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.5 cl-graph/dev/graph.lisp

Dependencies
Parent

dev (module)

Location

dev/graph.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.6 cl-graph/dev/graph-container.lisp

Dependency

graph.lisp (file)

Parent

dev (module)

Location

dev/graph-container.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.7 cl-graph/dev/graph-matrix.lisp

Dependency

graph.lisp (file)

Parent

dev (module)

Location

dev/graph-matrix.lisp

Exported Definitions
Internal Definitions

Next: , Previous: , Up: Lisp files   [Contents][Index]

3.1.8 cl-graph/dev/graph-algorithms.lisp

Dependency

graph.lisp (file)

Parent

dev (module)

Location

dev/graph-algorithms.lisp

Exported Definitions
Internal Definitions

Previous: , Up: Lisp files   [Contents][Index]

3.1.9 cl-graph/dev/graphviz/graphviz-support.lisp

Parent

graphviz (module)

Location

dev/graphviz/graphviz-support.lisp

Exported Definitions
Internal Definitions

Previous: , Up: Files   [Contents][Index]

3.2 Other


Next: , Previous: , Up: Other files   [Contents][Index]

3.2.1 cl-graph/COPYING

Parent

cl-graph (system)

Location

COPYING


Next: , Previous: , Up: Other files   [Contents][Index]

3.2.2 cl-graph/dev/notes.text

Parent

dev (module)

Location

dev/notes.text


Previous: , Up: Other files   [Contents][Index]

3.2.3 cl-graph/website/source/index.mmd

Parent

source (module)

Location

website/source/index.mmd


Next: , Previous: , Up: Top   [Contents][Index]

4 Packages

Packages are listed by definition order.


Previous: , Up: Packages   [Contents][Index]

4.1 cl-graph

CL-Graph is a Common Lisp library for manipulating graphs and running graph algorithms.

Source

package.lisp (file)

Nickname

metabang.graph

Use List
Exported Definitions
Internal Definitions

Next: , Previous: , Up: Top   [Contents][Index]

5 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


Next: , Previous: , Up: Definitions   [Contents][Index]

5.1 Exported definitions


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.1 Special variables

Special Variable: *dot-graph-attributes*
Package

cl-graph

Source

graphviz-support.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.2 Macros

Macro: with-changing-vertex (VERTEX) &body BODY

This is used to maintain consistency when changing the value of vertex elements while iterating over the vertexes...

Package

cl-graph

Source

macros.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.3 Compiler macros

Compiler Macro: vertex-count &rest ARGS
Package

cl-graph

Source

graph.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.4 Functions

Function: get-transitive-closure VERTEX-LIST &optional DEPTH

Given a list of vertices, returns a combined list of all of the nodes in the transitive closure(s) of each of the vertices in the list (without duplicates). Optional DEPTH limits the depth (in _both_ the child and parent directions) to which the closure is gathered; default nil gathers the entire closure(s).

Package

cl-graph

Source

graph.lisp (file)

Function: map-paths GRAPH START-VERTEX LENGTH FN &key FILTER

Apply fn to each path that starts at start-vertex and is of exactly length length

Package

cl-graph

Source

graph.lisp (file)

Function: map-shortest-paths GRAPH START-VERTEX DEPTH FN &key FILTER

Apply fn to each shortest path starting at ‘start-vertex‘ of depth ‘depth‘. The ‘filter‘ predicate is used to remove vertexes from consideration.

Package

cl-graph

Source

graph.lisp (file)

Function: print-dot-key-value KEY VALUE DOT-ATTRIBUTES STREAM
Package

cl-graph

Source

graphviz-support.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.5 Generic functions

Generic Function: add-edge GRAPH EDGE &rest ARGS &key FORCE-NEW?

Add-edge adds an existing edge to a graph. As add-edge-between-vertexes is generally more natural to use, this method is rarely called.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: add-edge (GRAPH graph-container) (EDGE graph-container-edge) &key FORCE-NEW?
Source

graph-container.lisp (file)

Method: add-edge (GRAPH basic-graph) (EDGE basic-edge) &key FORCE-NEW? before
Source

graph.lisp (file)

Generic Function: add-edge-between-vertexes GRAPH VALUE-OR-VERTEX-1 VALUE-OR-VERTEX-2 &rest ARGS &key IF-DUPLICATE-DO EDGE-TYPE VALUE EDGE-CLASS &allow-other-keys

Adds an edge between two vertexes and returns it.
If force-new? is true, the edge is added even if one already exists. If the vertexes are not found in the graph, they will be added (unless :error-if-not-found? is true). The class of the edge can be specified using :edge-class or :edge-type. If :edge-type is used, it can be either :directed or :undirected; the actual class of the edge will be determined by using the edge-types of the graph. If neither :edge-type nor :edge-class is specified, then a directed edge will be created.

If-duplicate-do is used when the ’same’ edge is added more than once. It can be either a function on one variable or :ignore
or :force. If it is :ignore, then the previously added edge is returned; if it is :force, then another edge is added between the two vertexes; if it is a function, then this function will be called with the previous edge.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: add-edge-between-vertexes (GRAPH basic-graph) (V-1 basic-vertex) (V-2 basic-vertex) &rest ARGS &key VALUE IF-DUPLICATE-DO EDGE-TYPE EDGE-CLASS &allow-other-keys
Source

graph.lisp (file)

Method: add-edge-between-vertexes (GRAPH basic-graph) VALUE-1 VALUE-2 &rest ARGS &key IF-DUPLICATE-DO &allow-other-keys
Source

graph.lisp (file)

Generic Function: add-vertex GRAPH VALUE-OR-VERTEX &key IF-DUPLICATE-DO &allow-other-keys

Adds a vertex to a graph. If called with a vertex,
then this vertex is added. If called with a value, then a new vertex is created to hold the value. If-duplicate-do can be one
of :ignore, :force, :replace, :replace-value, :error, or a function. The default is :ignore.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: add-vertex (GRAPH basic-graph) (VERTEX basic-vertex) &key &allow-other-keys before
Source

graph.lisp (file)

Method: add-vertex (GRAPH basic-graph) VALUE &rest ARGS &key IF-DUPLICATE-DO &allow-other-keys
Source

graph.lisp (file)

Method: add-vertex (GRAPH basic-graph) (VALUE basic-vertex) &key IF-DUPLICATE-DO
Source

graph.lisp (file)

Generic Function: adjacentp GRAPH VERTEX-1 VERTEX-2

Return true if vertex-1 and vertex-2 are connected
by an edge. [?? compare with vertices-share-edge-p and remove one or maybe call one directed-adjacentp]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: adjacentp (GRAPH basic-graph) (VERTEX-1 basic-vertex) (VERTEX-2 basic-vertex)
Source

graph.lisp (file)

Method: adjacentp (GRAPH basic-graph) VERTEX-1 VERTEX-2
Source

graph.lisp (file)

Generic Function: any-undirected-cycle-p GRAPH

Returns true if there are any undirected cycles in ‘graph‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: any-undirected-cycle-p (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: assortativity-coefficient MIXING-MATRIX

An assortative graph is one where vertexes of the
same type are more likely to have edges between them. The (discrete) assortativity-coefficient measures how assortative a graph is based on its mixing matrix. The definition we use is from Mixing Patterns in Networks by Mark Newman. See the citation ’newman200-mixing’ in moab or the URL ’http://arxiv.org/abs/cond-mat/0209450’.

Package

cl-graph

Source

api.lisp (file)

Generic Function: child-vertexes VERTEX &optional FILTER

Returns a list of the vertexes to which ‘vertex‘ is
connected by an edge and for which ‘vertex‘ is the source vertex. If the connecting edge is undirected, then the vertex is always counted as a source. [?? Could be a defun].

Package

cl-graph

Source

api.lisp (file)

Methods
Method: child-vertexes VERTEX &optional FILTER
Source

graph.lisp (file)

Generic Function: color OBJECT
Generic Function: (setf color) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: color (BASIC-EDGE basic-edge)
Method: (setf color) NEW-VALUE (BASIC-EDGE basic-edge)

The ‘color‘ is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]

Source

graph.lisp (file)

Method: color (BASIC-VERTEX basic-vertex)
Method: (setf color) NEW-VALUE (BASIC-VERTEX basic-vertex)

The ‘color‘ slot is used by some algorithms for bookkeeping.

Source

graph.lisp (file)

Generic Function: connected-component-count GRAPH

Returns the number of connected-components of graph.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: connected-component-count (GRAPH basic-graph)
Source

graph-algorithms.lisp (file)

Generic Function: connected-components GRAPH

Returns a union-find-container representing the connected-components of ‘graph‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: connected-components (GRAPH basic-graph)
Source

graph-algorithms.lisp (file)

Generic Function: connected-graph-p GRAPH &key EDGE-SORTER

Returns true if graph is a connected graph and nil otherwise.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: connected-graph-p (GRAPH basic-graph) &key EDGE-SORTER
Source

graph-algorithms.lisp (file)

Generic Function: contains-directed-edge-p OBJECT
Generic Function: (setf contains-directed-edge-p) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: contains-directed-edge-p (BASIC-GRAPH basic-graph)
Method: (setf contains-directed-edge-p) NEW-VALUE (BASIC-GRAPH basic-graph)

Returns true if graph contains at least one directed edge. [?? Not sure if this is really kept up-to-date.]

Source

graph.lisp (file)

Generic Function: contains-undirected-edge-p OBJECT
Generic Function: (setf contains-undirected-edge-p) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: contains-undirected-edge-p (BASIC-GRAPH basic-graph)
Method: (setf contains-undirected-edge-p) NEW-VALUE (BASIC-GRAPH basic-graph)

Returns true if graph contains at least one undirected edge. [?? Not sure if this is really kept up-to-date.]

Source

graph.lisp (file)

Generic Function: default-edge-class OBJECT
Package

cl-graph

Methods
Method: default-edge-class (BASIC-GRAPH basic-graph)

The default edge class for the graph.

Source

graph.lisp (file)

Generic Function: default-edge-type OBJECT
Package

cl-graph

Methods
Method: default-edge-type (BASIC-GRAPH basic-graph)

The default edge type for the graph. This should be one of :undirected or :directed.

Source

graph.lisp (file)

Generic Function: delete-all-edges GRAPH

Delete all edges from ‘graph’. Returns the graph..

Package

cl-graph

Source

api.lisp (file)

Methods
Method: delete-all-edges (GRAPH graph-container)
Source

graph-container.lisp (file)

Method: delete-all-edges (GRAPH basic-graph) after
Source

graph.lisp (file)

Generic Function: delete-edge GRAPH EDGE

Delete the ‘edge’ from the ‘graph’ and returns it.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: delete-edge (GRAPH graph-container) (EDGE graph-container-edge)
Source

graph-container.lisp (file)

Method: delete-edge (GRAPH basic-graph) (EDGE basic-edge) after
Source

graph.lisp (file)

Generic Function: delete-edge-between-vertexes GRAPH VALUE-OR-VERTEX-1 VALUE-OR-VERTEX-2 &rest ARGS

Finds an edge in the graph between the two
specified vertexes. If values (i.e., non-vertexes) are passed in, then the graph will be searched for matching vertexes.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: delete-edge-between-vertexes (GRAPH basic-graph) VALUE-OR-VERTEX-1 VALUE-OR-VERTEX-2 &rest ARGS
Source

graph.lisp (file)

Generic Function: delete-vertex GRAPH VALUE-OR-VERTEX

Remove a vertex from a graph. The ’vertex-or-value’
argument can be a vertex of the graph or a ’value’ that will find a vertex via a call to find-vertex. A graph-vertex-not-found-error will be raised if the vertex is not found or is not part of the graph.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: delete-vertex (GRAPH basic-graph) (VERTEX basic-vertex) after
Source

graph.lisp (file)

Method: delete-vertex (GRAPH basic-graph) (VERTEX basic-vertex)
Source

graph.lisp (file)

Method: delete-vertex (GRAPH basic-graph) VALUE-OR-VERTEX
Source

graph.lisp (file)

Generic Function: depth GRAPH

Returns the maximum depth of the vertexes in graph
assuming that the roots are of depth 0 and that each edge distance from the roots increments the depth by one.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: depth (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: depth-level OBJECT
Generic Function: (setf depth-level) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: depth-level (BASIC-VERTEX basic-vertex)
Method: (setf depth-level) NEW-VALUE (BASIC-VERTEX basic-vertex)

‘Depth-level‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Source

graph.lisp (file)

Generic Function: dfs GRAPH ROOT FN &key OUT-EDGE-SORTER
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs (GRAPH basic-graph) (ROOT basic-vertex) FN &key OUT-EDGE-SORTER
Source

graph-algorithms.lisp (file)

Method: dfs (GRAPH basic-graph) ROOT FN &key OUT-EDGE-SORTER
Source

graph-algorithms.lisp (file)

Generic Function: dfs-back-edge-p EDGE
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs-back-edge-p (EDGE graph-container-edge)
Source

graph-algorithms.lisp (file)

Generic Function: dfs-edge-type EDGE
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs-edge-type (EDGE graph-container-edge)
Source

graph-algorithms.lisp (file)

Generic Function: dfs-tree-edge-p EDGE
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs-tree-edge-p (EDGE graph-container-edge)
Source

graph-algorithms.lisp (file)

Generic Function: directed-edge-class OBJECT
Package

cl-graph

Methods
Method: directed-edge-class (BASIC-GRAPH basic-graph)

The class used to create directed edges in the graph. This must extend the base-class for edges of the graph type and directed-edge-mixin. E.g., the directed-edge-class of a graph-container must extend graph-container-edge and directed-edge-mixin.

Source

graph.lisp (file)

Generic Function: directed-edge-p EDGE

Returns true if-and-only-if edge is directed

Package

cl-graph

Source

api.lisp (file)

Methods
Method: directed-edge-p (EDGE basic-edge)
Source

graph.lisp (file)

Generic Function: discovery-time OBJECT
Generic Function: (setf discovery-time) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: discovery-time (BASIC-VERTEX basic-vertex)
Method: (setf discovery-time) NEW-VALUE (BASIC-VERTEX basic-vertex)

‘Discovery-time‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Source

graph.lisp (file)

Generic Function: dot-attribute-value ATTRIBUTE THING
Generic Function: (setf dot-attribute-value) VALUE ATTRIBUTE THING
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dot-attribute-value (ATTR symbol) (THING dot-attributes-mixin)
Method: (setf dot-attribute-value) VALUE (ATTR symbol) (THING dot-attributes-mixin)
Source

graphviz-support.lisp (file)

Method: (setf dot-attribute-value) VALUE (ATTR symbol) (THING dot-attributes-mixin) before
Source

graphviz-support.lisp (file)

Generic Function: dot-attributes OBJECT
Generic Function: (setf dot-attributes) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: dot-attributes (DOT-ATTRIBUTES-MIXIN dot-attributes-mixin)

automatically generated reader method

Source

graphviz-support.lisp (file)

Method: (setf dot-attributes) NEW-VALUE (DOT-ATTRIBUTES-MIXIN dot-attributes-mixin)

automatically generated writer method

Source

graphviz-support.lisp (file)

Generic Function: edge CONDITION
Package

cl-graph

Methods
Method: edge (CONDITION edge-error)
Source

graph.lisp (file)

Generic Function: edge->dot EDGE STREAM

Used by graph->dot to output edge formatting for
‘edge‘ onto the ‘stream‘. The function can assume that openning and closing square brackets and label have already been taken care of.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: edge->dot (EDGE dot-edge-mixin) STREAM
Source

graphviz-support.lisp (file)

Method: edge->dot (V basic-edge) (STREAM stream)
Source

graphviz-support.lisp (file)

Generic Function: edge-count VERTEX

Returns the number of edges attached to
‘vertex‘. Compare with the more flexible ‘vertex-degree‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: edge-count (GRAPH graph-container)
Source

graph-container.lisp (file)

Method: edge-count (VERTEX basic-vertex)
Source

graph.lisp (file)

Method: edge-count (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: edge-id OBJECT
Generic Function: (setf edge-id) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: edge-id (BASIC-EDGE basic-edge)
Method: (setf edge-id) NEW-VALUE (BASIC-EDGE basic-edge)

The ‘edge-id‘ is used internally by CL-Graph for bookkeeping.

Source

graph.lisp (file)

Generic Function: edge-lessp-by-direction EDGE-1 EDGE-2

Returns true if and only if edge-1 is undirected and edge-2 is directed.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: edge-lessp-by-direction (E1 basic-edge) (E2 basic-edge)
Source

graph-algorithms.lisp (file)

Generic Function: edge-lessp-by-weight EDGE-1 EDGE-2

Returns true if the weight of edge-1 is strictly less than the weight of edge-2.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: edge-lessp-by-weight (E1 basic-edge) (E2 basic-edge)
Source

graph-algorithms.lisp (file)

Generic Function: edges THING

Returns a list of the edges of ‘thing‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: edges (VERTEX basic-vertex)
Source

graph.lisp (file)

Method: edges (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: find-connected-components GRAPH

Returns a list of sub-graphs of ‘graph‘ where each
sub-graph is a different connected component of graph. Compare with connected-components and connected-component-count.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-connected-components (GRAPH basic-graph)
Source

graph-algorithms.lisp (file)

Generic Function: find-edge GRAPH EDGE &optional ERROR-IF-NOT-FOUND?

Search ‘graph‘ for an edge whose vertexes match
‘edge‘. This means that ‘vertex-1‘ of the edge in the graph must match ‘vertex-1‘ of ‘edge‘ and so forth. Wil signal an error of type ‘graph-edge-not-found-error‘ unless ‘error-if-not-found?‘ is nil. [?? Unused. Remove?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-edge (GRAPH graph-container) (EDGE graph-container-edge) &optional ERROR-IF-NOT-FOUND?
Source

graph-container.lisp (file)

Generic Function: find-edge-between-vertexes GRAPH VALUE-OR-VERTEX-1 VALUE-OR-VERTEX-2 &key ERROR-IF-NOT-FOUND?

Searches ‘graph‘ for an edge that connects vertex-1
and vertex-2. [?? Ignores error-if-not-found? Does directedness matter? need test]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-edge-between-vertexes (GRAPH graph-container) (VERTEX-1 graph-container-vertex) (VERTEX-2 graph-container-vertex) &key ERROR-IF-NOT-FOUND?
Source

graph-container.lisp (file)

Method: find-edge-between-vertexes (GRAPH basic-graph) VALUE-1 VALUE-2 &key ERROR-IF-NOT-FOUND?
Source

graph.lisp (file)

Generic Function: find-edge-between-vertexes-if GRAPH VALUE-OR-VERTEX-1 VALUE-OR-VERTEX-2 FN &key ERROR-IF-NOT-FOUND?

Finds and returns an edge between value-or-vertex-1
and value-or-vertex-2 which returns true (as a generalized boolean) when evaluated by ‘fn‘. Unless error-if-not-found? is nil, then a error will be signaled. [?? IS error really signaled? need a test.]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-edge-between-vertexes-if (GRAPH graph-container) VALUE-1 VALUE-2 FN &key ERROR-IF-NOT-FOUND?
Source

graph-container.lisp (file)

Method: find-edge-between-vertexes-if (GRAPH graph-container) (VERTEX-1 graph-container-vertex) (VERTEX-2 graph-container-vertex) FN &key ERROR-IF-NOT-FOUND?
Source

graph-container.lisp (file)

Generic Function: find-edge-if GRAPH FN &key KEY

Returns the first edge in ‘thing‘ for which the
‘predicate‘ function returns non-nil. If the ‘key‘ is supplied, then it is applied to the edge before the predicate is.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-edge-if (GRAPH basic-graph) FN &key KEY
Source

graph.lisp (file)

Generic Function: find-edges-if THING PREDICATE

Returns a list of edges in ‘thing‘ for which the ‘predicate‘ returns non-nil. [?? why no key function?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-edges-if (GRAPH basic-graph) FN
Source

graph.lisp (file)

Generic Function: find-vertex GRAPH VALUE &optional ERROR-IF-NOT-FOUND?

Search ’graph’ for a vertex with element
’value’. The search is fast but inflexible because it uses an associative-container. If you need more flexibity, see search-for-vertex.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-vertex (EDGE basic-edge) VALUE &optional ERROR-IF-NOT-FOUND?
Source

graph.lisp (file)

Method: find-vertex (GRAPH basic-graph) (VERTEX basic-vertex) &optional ERROR-IF-NOT-FOUND?
Source

graph.lisp (file)

Method: find-vertex (GRAPH basic-graph) VALUE &optional ERROR-IF-NOT-FOUND?
Source

graph.lisp (file)

Generic Function: find-vertex-if THING PREDICATE &key KEY

Returns the first vertex in ‘thing‘ for which the
‘predicate‘ function returns non-nil. If the ‘key‘ is supplied, then it is applied to the vertex before the predicate is.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-vertex-if (EDGE basic-edge) FN &key KEY
Source

graph.lisp (file)

Method: find-vertex-if (GRAPH basic-graph) FN &key KEY
Source

graph.lisp (file)

Generic Function: find-vertexes-if THING PREDICATE

Returns a list of vertexes in ‘thing‘ for which the ‘predicate‘ returns non-nil. [?? why no key function?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: find-vertexes-if (GRAPH basic-graph) FN
Source

graph.lisp (file)

Generic Function: finish-time OBJECT
Generic Function: (setf finish-time) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: finish-time (BASIC-VERTEX basic-vertex)
Method: (setf finish-time) NEW-VALUE (BASIC-VERTEX basic-vertex)

‘Finish-time‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Source

graph.lisp (file)

Generic Function: force-undirected GRAPH

Ensures that the graph is undirected (possibly by calling change-class on the edges).

Package

cl-graph

Source

api.lisp (file)

Methods
Method: force-undirected (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: generate-directed-free-tree GRAPH ROOT

Returns a version of graph which is a directed free tree rooted at root.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: generate-directed-free-tree (GRAPH basic-graph) ROOT
Source

graph.lisp (file)

Generic Function: graph OBJECT
Generic Function: (setf graph) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: graph (BASIC-EDGE basic-edge)

The ‘graph‘ of which this edge is a part.

Source

graph.lisp (file)

Method: graph (BASIC-VERTEX basic-vertex)
Method: (setf graph) NEW-VALUE (BASIC-VERTEX basic-vertex)

The graph in which this vertex is contained.

Source

graph.lisp (file)

Method: graph (CONDITION graph-error)
Source

graph.lisp (file)

Generic Function: graph->dot GRAPH OUTPUT &key GRAPH-FORMATTER VERTEX-KEY VERTEX-LABELER VERTEX-FORMATTER EDGE-LABELER EDGE-FORMATTER &allow-other-keys

Generates a description of ‘graph‘ in DOT file format. The
formatting can be altered using ‘graph->dot-properties,‘ ‘vertex->dot,‘ and ‘edge->dot‘ as well as ‘edge-formatter,‘ ‘vertex-formatter,‘ ‘vertex-labeler,‘ and ‘edge-labeler‘. These can
be specified directly in the call to ‘graph->dot‘ or by creating subclasses of basic-graph, basic-vertex and basic-edge.

The output can be a stream or pathname or one of the values ‘nil‘ or
‘t‘. If output is ‘nil‘, then graph->dot returns a string containing
the DOT description. If it is ‘t‘, then the DOT description is written
to \*standard-output\*.

Here is an example;

(let ((g (make-container ’graph-container :default-edge-type :directed))) (loop for (a b) in ’((a b) (b c) (b d) (d e) (e f) (d f)) do (add-edge-between-vertexes g a b))
(graph->dot g nil))

"digraph G {
E []
C []
B []
A []
D []
F []
E->F []
B->C []
B->D []
A->B []
D->E []
D->F []
}"

For more information about DOT file format, search the web for ’DOTTY’ and ’GRAPHVIZ’.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: graph->dot (G basic-graph) (STREAM pathname) &rest ARGS &key &allow-other-keys
Source

graphviz-support.lisp (file)

Method: graph->dot (G basic-graph) (STREAM string) &rest ARGS &key &allow-other-keys
Source

graphviz-support.lisp (file)

Method: graph->dot (G basic-graph) (STREAM (eql t)) &rest ARGS &key &allow-other-keys
Source

graphviz-support.lisp (file)

Method: graph->dot (G basic-graph) (STREAM (eql nil)) &rest ARGS &key &allow-other-keys
Source

graphviz-support.lisp (file)

Method: graph->dot (G basic-graph) (STREAM stream) &key GRAPH-FORMATTER VERTEX-KEY VERTEX-LABELER VERTEX-FORMATTER EDGE-LABELER EDGE-FORMATTER &allow-other-keys
Source

graphviz-support.lisp (file)

Generic Function: graph->dot-external GRAPH FILE-NAME &key TYPE &allow-other-keys
Package

cl-graph

Source

api.lisp (file)

Methods
Method: graph->dot-external (G basic-graph) FILE-NAME &rest ARGS &key TYPE &allow-other-keys

Generate an external represenation of a graph to a file, by running the program in *dot-path*.

Source

graphviz-support.lisp (file)

Generic Function: graph->dot-properties G STREAM

Unless a different graph-formatter is specified,
this method is called by graph->dot to output graph-properties onto a stream. The function can assume that the openning and closing brackets will be taken care of by the graph->dot.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: graph->dot-properties (GRAPH dot-graph-mixin) STREAM
Source

graphviz-support.lisp (file)

Method: graph->dot-properties G STREAM
Source

graphviz-support.lisp (file)

Generic Function: graph-edge-mixture-matrix GRAPH VERTEX-CLASSIFIER &key EDGE-WEIGHT

Return the ‘mixing-matrix‘ of graph based on the
classifier and the edge-weight function. The mixing matrix is a matrix whose runs and columns represent each class of vertex in the graph. The entries of the matrix show the total number of edges between vertexes of the two kinds. [?? Edge-weight is not used; also compare with graph-mixture-matrix.]

Package

cl-graph

Source

api.lisp (file)

Generic Function: graph-edges OBJECT
Package

cl-graph

Methods
Method: graph-edges (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: graph-mixing-matrix GRAPH VERTEX-CLASSIFIER &key EDGE-WEIGHT

Return the ‘mixing-matrix‘ of graph based on the
classifier and the edge-weight function. The mixing matrix is a matrix whose runs and columns represent each class of vertex in the graph. The entries of the matrix show the total number of edges between vertexes of the two kinds. [?? Edge-weight is not used; also compare with graph-edge-mixture-matrix.]

Package

cl-graph

Source

api.lisp (file)

Generic Function: graph-roots GRAPH

Returns a list of the roots of graph. A root is
defined as a vertex with no source edges (i.e., all of the edges are out-going). (cf. rootp) [?? could be a defun]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: graph-roots (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: graph-vertexes OBJECT
Package

cl-graph

Methods
Method: graph-vertexes (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: has-children-p VERTEX

In a directed graph, returns true if vertex has any
edges that point from vertex to some other
vertex (cf. iterate-source-edges). In an undirected graph, ‘has-children-p‘ is testing only whether or not the vertex has any edges.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: has-children-p (VERTEX graph-container-vertex)
Source

graph-container.lisp (file)

Generic Function: has-parent-p VERTEX

In a directed graph, returns true if vertex has any
edges that point from some other vertex to this
vertex (cf. iterate-target-edges). In an undirected graph, ‘has-parent-p‘ is testing only whether or not the vertex has any edges.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: has-parent-p (VERTEX graph-container-vertex)
Source

graph-container.lisp (file)

Generic Function: height-in-pixels THING
Generic Function: (setf height-in-pixels) VALUE THING
Package

cl-graph

Methods
Method: height-in-pixels (THING dot-vertex-mixin)

Return the attribute in pixels assuming 72 dpi

Source

graphviz-support.lisp (file)

Method: (setf height-in-pixels) VALUE (THING dot-vertex-mixin)

Set the attribute in pixels assuming 72 dpi

Source

graphviz-support.lisp (file)

Generic Function: in-cycle-p GRAPH START-VERTEX

Returns true if ‘start-vertex‘ is in some cycle in
‘graph‘. This uses child-vertexes to generate the vertexes adjacent to a vertex.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: in-cycle-p (GRAPH basic-graph) (START-VERTEX basic-vertex)
Source

graph.lisp (file)

Method: in-cycle-p (GRAPH basic-graph) VERTEX
Source

graph.lisp (file)

Generic Function: in-undirected-cycle-p GRAPH START-VERTEX &optional MARKED PREVIOUS

Return true if-and-only-if an undirected cycle in graph is reachable from start-vertex.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: in-undirected-cycle-p (GRAPH basic-graph) (CURRENT basic-vertex) &optional MARKED PREVIOUS
Source

graph.lisp (file)

Generic Function: iterate-edges GRAPH-OR-VERTEX FN

Calls ‘fn‘ on each edge of graph or vertex.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: iterate-edges (VERTEX graph-container-vertex) FN
Source

graph-container.lisp (file)

Method: iterate-edges (GRAPH graph-container) FN
Source

graph-container.lisp (file)

Generic Function: iterate-neighbors VERTEX FN

Calls fn on every vertex adjecent to vertex See also iterate-children and iterate-parents.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: iterate-neighbors (VERTEX graph-container-vertex) FN
Source

graph-container.lisp (file)

Generic Function: iterate-parents VERTEX FN

Calls fn on every vertex that is either connected
to vertex by an undirected edge or is at the source end of a directed edge.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: iterate-parents (VERTEX graph-container-vertex) FN
Source

graph-container.lisp (file)

Generic Function: iterate-source-edges VERTEX FN

In a directed graph, calls ‘fn‘ on each edge of a
vertex that begins at vertex. In an undirected graph, this is equivalent to ‘iterate-edges‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: iterate-source-edges (VERTEX graph-container-vertex) FN
Source

graph-container.lisp (file)

Generic Function: iterate-target-edges VERTEX FN

In a directed graph, calls ‘fn‘ on each edge of a
vertex that ends at vertex. In an undirected graph, this is equivalent to ‘iterate-edges‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: iterate-target-edges (VERTEX graph-container-vertex) FN
Source

graph-container.lisp (file)

Generic Function: iterate-vertexes THING FN

Calls ‘fn‘ on each of the vertexes of ‘thing‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: iterate-vertexes (EDGE basic-edge) FN
Source

graph.lisp (file)

Method: iterate-vertexes (GRAPH basic-graph) FN
Source

graph.lisp (file)

Generic Function: make-filtered-graph OLD-GRAPH TEST-FN &key GRAPH-COMPLETION-METHOD DEPTH NEW-GRAPH

Takes a GRAPH and a TEST-FN (a single argument
function returning NIL or non-NIL), and filters the graph nodes according to the test-fn (those that return non-NIL are accepted), returning a new graph with only nodes corresponding to those in the original graph that satisfy the test (the nodes in the new graph are new, but their values and name point to the same contents of the original graph). There are four options for how the new graph is filled-out, depending on the following keywords passed to the optional GRAPH-COMPLETION-METHOD argument:

* NIL (default)

New graph has only nodes that correspond to those in the original graph that pass the test. NO LINKS are reproduced.

* :COMPLETE-LINKS

New graph has only nodes that pass, but reproduces corresponding links between passing nodes in the original graph.

* :COMPLETE-CLOSURE-NODES-ONLY

New graph also includes nodes corresponding to the transitive closure(s) that include the passign nodes in the original graph. NO LINKS are reproduced.

* :COMPLETE-CLOSURE-WITH-LINKS

Same as above, except corresponding links are reproduced.

For both transitive closure options, an additional optional argument, DEPTH, specifies how many links away from a source vertex to travel in gathering vertexes of the closure. E.g., a depth of 1 returns the source vertex and the parents and children of that vertex (all vertexes one link away from the source). The default value is NIL, indicating that all vertexes are to be included, no matter their depth. This value is ignored in non closure options.

Package

cl-graph

Source

api.lisp (file)

Generic Function: make-graph GRAPH-TYPE &key &allow-other-keys

Create a new graph of type ‘graph-type’. Graph type
can be a symbol naming a sub-class of basic-graph or a list. If it is a list of symbols naming different classes. If graph-type is a list, then a class which has all of the listed classes as superclasses will be found (or created). In either case, the new graph will be created as if with a call to make-instance.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: make-graph (GRAPH-TYPE symbol) &rest ARGS &key &allow-other-keys
Source

graph.lisp (file)

Generic Function: make-graph-from-vertexes VERTEX-LIST

Create a new graph given a list of vertexes (which
are assumed to be from the same graph). The new graph contains all of the vertexes in the list and all of the edges between any vertexes on the list.

Package

cl-graph

Source

api.lisp (file)

Generic Function: make-vertex-edges-container VERTEX CONTAINER-CLASS &rest ARGS

Called during the initialization of a vertex to
create the create the container used to store the edges incident to the vertex. The initarg :vertex-edges-container-class can be used to alter the default container class.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: make-vertex-edges-container (VERTEX graph-container-vertex) CONTAINER-CLASS &rest ARGS
Source

graph-container.lisp (file)

Generic Function: make-vertex-for-graph GRAPH &key VERTEX-CLASS &allow-other-keys

Creates a new vertex for graph ‘graph‘. The keyword
arguments include:

* vertex-class : specify the class of the vertex
* element : specify the ‘element‘ of the vertex

and any other initialization arguments that make sense for the vertex class.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: make-vertex-for-graph (GRAPH basic-graph) &rest ARGS &key VERTEX-CLASS &allow-other-keys
Source

graph.lisp (file)

Generic Function: minimum-spanning-tree GRAPH &key EDGE-SORTER

Returns a minimum spanning tree of graph if one exists and nil otherwise.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: minimum-spanning-tree (GRAPH basic-graph) &key EDGE-SORTER
Source

graph-algorithms.lisp (file)

Generic Function: neighbor-vertexes VERTEX &optional FILTER

Returns a list of the vertexes to which ‘vertex‘ is
connected by an edge disregarding edge direction. In a directed graph, neighbor-vertexes is the union of parent-vertexes and child-vertexes. [?? Could be a defun].

Package

cl-graph

Source

api.lisp (file)

Methods
Method: neighbor-vertexes VERTEX &optional FILTER
Source

graph.lisp (file)

Generic Function: next-node OBJECT
Generic Function: (setf next-node) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: next-node (BASIC-VERTEX basic-vertex)
Method: (setf next-node) NEW-VALUE (BASIC-VERTEX basic-vertex)

‘Next-node‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Source

graph.lisp (file)

Generic Function: number-of-neighbors VERTEX

Returns the number of neighbors of
‘vertex‘ (cf. ‘neighbor-vertexes‘). [?? could be a defun]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: number-of-neighbors VERTEX
Source

graph.lisp (file)

Generic Function: other-vertex EDGE VALUE-OR-VERTEX

Assuming that the value-or-vertex corresponds to
one of the vertexes for ‘edge‘, this method returns the other vertex of ‘edge‘. If the value-or-vertex is not part of edge, then an error is signaled. [?? Should create a new condition for this]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: other-vertex (EDGE graph-container-edge) VALUE
Source

graph-container.lisp (file)

Method: other-vertex (EDGE graph-container-edge) (V graph-container-vertex)
Source

graph-container.lisp (file)

Generic Function: out-edge-for-vertex-p EDGE VERTEX

Returns true if the edge is connected to vertex and
is either an undirected edge or a directed edge for which vertex is the source vertex of the edge.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: out-edge-for-vertex-p (EDGE basic-edge) (VERTEX basic-vertex)
Source

graph-algorithms.lisp (file)

Generic Function: parent-vertexes VERTEX &optional FILTER

Returns a list of the vertexes to which ‘vertex‘ is
connected by an edge and for which ‘vertex‘ is the target vertex. If the connecting edge is undirected, then the vertex is always counted as a target. [?? Could be a defun].

Package

cl-graph

Source

api.lisp (file)

Methods
Method: parent-vertexes VERTEX &optional FILTER
Source

graph.lisp (file)

Generic Function: previous-node OBJECT
Generic Function: (setf previous-node) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: previous-node (BASIC-VERTEX basic-vertex)
Method: (setf previous-node) NEW-VALUE (BASIC-VERTEX basic-vertex)

‘Previous-node‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Source

graph.lisp (file)

Generic Function: project-bipartite-graph NEW-GRAPH EXISTING-GRAPH VERTEX-CLASS VERTEX-CLASSIFIER

Creates the unimodal bipartite projects of
existing-graph with vertexes for each vertex of existing graph whose ‘vertex-classifier‘ is eq to ‘vertex-class‘ and where an edge existing between two vertexes of the graph if and only if they are connected to a shared vertex in the existing-graph.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: project-bipartite-graph (NEW-GRAPH basic-graph) GRAPH VERTEX-CLASS VERTEX-CLASSIFIER
Source

graph.lisp (file)

Method: project-bipartite-graph (NEW-GRAPH symbol) GRAPH VERTEX-CLASS VERTEX-CLASSIFIER
Source

graph.lisp (file)

Generic Function: rank OBJECT
Generic Function: (setf rank) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: rank (BASIC-VERTEX basic-vertex)
Method: (setf rank) NEW-VALUE (BASIC-VERTEX basic-vertex)

The ‘rank‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Source

graph.lisp (file)

Generic Function: renumber-edges GRAPH

Assign a number to each edge in a graph in some unspecified order. [?? internal]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: renumber-edges (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: renumber-vertexes GRAPH

Assign a number to each vertex in a graph in some unspecified order. [?? internal]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: renumber-vertexes (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: replace-vertex GRAPH OLD NEW

Replace vertex ‘old‘ in graph ‘graph‘ with vertex ‘new‘. The edge structure of the graph is maintained.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: replace-vertex (GRAPH graph-container) (OLD basic-vertex) (NEW basic-vertex) after
Source

graph-container.lisp (file)

Method: replace-vertex (GRAPH graph-container) (OLD basic-vertex) (NEW basic-vertex) before
Source

graph-container.lisp (file)

Method: replace-vertex (GRAPH basic-graph) (OLD basic-vertex) (NEW basic-vertex)
Source

graph.lisp (file)

Generic Function: rooted-dfs GRAPH ROOT FN &key OUT-EDGE-SORTER

A variant of DFS that does not visit nodes that are unreachable from the ROOT.

Package

cl-graph

Source

graph-algorithms.lisp (file)

Methods
Method: rooted-dfs (GRAPH basic-graph) ROOT FN &key OUT-EDGE-SORTER
Method: rooted-dfs (GRAPH basic-graph) (ROOT basic-vertex) FN &key OUT-EDGE-SORTER
Generic Function: rootp VERTEX

Returns true if ‘vertex‘ is a root vertex (i.e., it has no incoming (source) edges).

Package

cl-graph

Source

api.lisp (file)

Methods
Method: rootp (VERTEX basic-vertex)
Source

graph.lisp (file)

Generic Function: search-for-vertex GRAPH VALUE &key KEY TEST ERROR-IF-NOT-FOUND?

Search ’graph’ for a vertex with element
’value’. The ’key’ function is applied to each element before that element is compared with the value. The comparison is done using the function ’test’. If you don’t need to use key or test, then consider using find-vertex instead.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: search-for-vertex (GRAPH basic-graph) VERTEX &key KEY TEST ERROR-IF-NOT-FOUND?
Source

graph.lisp (file)

Method: search-for-vertex (GRAPH basic-graph) (VERTEX basic-vertex) &key KEY TEST ERROR-IF-NOT-FOUND?
Source

graph.lisp (file)

Generic Function: source-edge-count VERTEX

Returns the number of source edges of
vertex (cf. source-edges). [?? could be a defun]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: source-edge-count (VERTEX basic-vertex)
Source

graph.lisp (file)

Generic Function: source-edges VERTEX &optional FILTER

Returns a list of the source edges of ‘vertex‘. I.e., the edges that begin at ‘vertex‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: source-edges (VERTEX basic-vertex) &optional FILTER
Source

graph.lisp (file)

Generic Function: source-vertex EDGE

Returns the source-vertex of a directed edge. Compare with ‘vertex-1‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: source-vertex (EDGE graph-container-edge)
Source

graph-container.lisp (file)

Generic Function: subgraph-containing GRAPH VERTEX &key DEPTH NEW-GRAPH

Returns a new graph that is a subset of ‘graph‘
that contains ‘vertex‘ and all of the other vertexes that can be reached from vertex by paths of less than or equal of length ‘depth‘. If depth is not specified, then the entire sub-graph reachable from vertex will be returned. [?? Edge weights are always assumed to be one.]

Package

cl-graph

Source

api.lisp (file)

Generic Function: tag-all-edges THING

Sets the ‘tag‘ of all the edges of ‘thing‘ to true. [?? why does this exist?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: tag-all-edges (VERTEX basic-vertex)
Source

graph.lisp (file)

Method: tag-all-edges (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: tagged-edge-p EDGE

Returns true if-and-only-if edge’s tag slot is t

Package

cl-graph

Source

api.lisp (file)

Methods
Method: tagged-edge-p (EDGE basic-edge)
Source

graph.lisp (file)

Generic Function: target-edge-count VERTEX

Returns the number of target edges of
vertex (cf. target-edges). [?? could be a defun]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: target-edge-count (VERTEX basic-vertex)
Source

graph.lisp (file)

Generic Function: target-edges VERTEX &optional FILTER

Returns a list of the target edges of ‘vertex‘. I.e., the edges that end at ‘vertex‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: target-edges (VERTEX basic-vertex) &optional FILTER
Source

graph.lisp (file)

Generic Function: target-vertex EDGE

Returns the target-vertex of a directed edge. Compare with ‘vertex-2‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: target-vertex (EDGE graph-container-edge)
Source

graph-container.lisp (file)

Generic Function: topological-sort GRAPH

Returns a list of vertexes sorted by the depth from
the roots of the graph. See also assign-level and graph-roots.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: topological-sort (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: undirected-edge-class OBJECT
Package

cl-graph

Methods
Method: undirected-edge-class (BASIC-GRAPH basic-graph)

The class used to create undirected edges in the graph. This must extend the base-class for edges of the graph type and undirected-edge-mixin. E.g., all undirected edges of a graph-container must extend graph-container-edge and undirected-edge-mixin.

Source

graph.lisp (file)

Generic Function: undirected-edge-p EDGE

Returns true if-and-only-if edge is undirected

Package

cl-graph

Source

api.lisp (file)

Methods
Method: undirected-edge-p (EDGE basic-edge)
Source

graph.lisp (file)

Generic Function: untag-all-edges THING

Sets the ‘tag‘ of all the edges of ‘thing‘ to nil. [?? why does this exist?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: untag-all-edges (VERTEX basic-vertex)
Source

graph.lisp (file)

Method: untag-all-edges (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: untagged-edge-p EDGE

Returns true if-and-only-if edge’s tage slot is nil

Package

cl-graph

Source

api.lisp (file)

Methods
Method: untagged-edge-p (EDGE basic-edge)
Source

graph.lisp (file)

Generic Function: vertex CONDITION
Package

cl-graph

Methods
Method: vertex (CONDITION graph-vertex-not-found-in-edge-error)
Source

graph.lisp (file)

Method: vertex (CONDITION graph-vertex-not-found-error)
Source

graph.lisp (file)

Generic Function: vertex-1 CONDITION
Package

cl-graph

Methods
Method: vertex-1 (GRAPH-CONTAINER-EDGE graph-container-edge)

‘Vertex-1‘ is one of the two vertexes that an edge connects. In a directed-edge, ‘vertex-1‘ is also the ‘source-vertex‘.

Source

graph-container.lisp (file)

Method: vertex-1 (CONDITION graph-edge-not-found-error)
Source

graph.lisp (file)

Generic Function: vertex-2 CONDITION
Package

cl-graph

Methods
Method: vertex-2 (GRAPH-CONTAINER-EDGE graph-container-edge)

‘Vertex-2‘ is one of the two vertexes that an edge connects. In a directed edge, ‘vertex-2‘ is also the ‘target-vertex‘.

Source

graph-container.lisp (file)

Method: vertex-2 (CONDITION graph-edge-not-found-error)
Source

graph.lisp (file)

Generic Function: vertex->dot VERTEX STREAM

Unless a different vertex-formatter is specified
with a keyword argument, this is used by graph->dot to output vertex formatting for ‘vertex‘ onto the ‘stream‘. The function can assume that openning and closing square brackets and label have already been taken care of.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: vertex->dot (VERTEX dot-vertex-mixin) STREAM
Source

graphviz-support.lisp (file)

Method: vertex->dot (V basic-vertex) (STREAM stream)
Source

graphviz-support.lisp (file)

Generic Function: vertex-class OBJECT
Package

cl-graph

Methods
Method: vertex-class (BASIC-GRAPH basic-graph)

The class of the vertexes in the graph. This must extend the base-class for vertexes of the graph type. E.g., all vertexes of a graph-container must extend graph-container-vertex.

Source

graph.lisp (file)

Generic Function: vertex-count GRAPH

Returns the number of vertexes in ‘graph‘. [?? could be a defun]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: vertex-count (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: vertex-id OBJECT
Package

cl-graph

Methods
Method: vertex-id (BASIC-VERTEX basic-vertex)

‘Vertex-id‘ is used internally to keep track of vertexes.

Source

graph.lisp (file)

Generic Function: vertexes THING

Returns a list of the vertexes of ‘thing‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: vertexes (EDGE graph-container-edge)
Source

graph-container.lisp (file)

Method: vertexes (GRAPH basic-graph)
Source

graph.lisp (file)

Generic Function: vertices-share-edge-p VERTEX-1 VERTEX-2

Return true if vertex-1 and vertex-2 are connected by an edge. [?? Compare adjacentp]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: vertices-share-edge-p (VERTEX-1 graph-container-vertex) (VERTEX-2 graph-container-vertex)
Source

graph-container.lisp (file)

Generic Function: width-in-pixels THING
Generic Function: (setf width-in-pixels) VALUE THING
Package

cl-graph

Methods
Method: width-in-pixels (THING dot-vertex-mixin)

Return the attribute in pixels assuming 72 dpi

Source

graphviz-support.lisp (file)

Method: (setf width-in-pixels) VALUE (THING dot-vertex-mixin)

Set the attribute in pixels assuming 72 dpi

Source

graphviz-support.lisp (file)


Next: , Previous: , Up: Exported definitions   [Contents][Index]

5.1.6 Conditions

Condition: edge-error ()

This is the root condition for graph errors that have to do with edges.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

graph-error (condition)

Direct subclasses

graph-vertex-not-found-in-edge-error (condition)

Direct methods

edge (method)

Direct slots
Slot: edge

The ‘edge‘ that is implicated in the condition.

Initargs

:edge

Initform

(quote nil)

Readers

edge (generic function)

Condition: graph-edge-not-found-error ()

This condition is signaled when an edge cannot be found in a graph.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

graph-error (condition)

Direct methods
Direct slots
Slot: vertex-1

One of the vertexes for which no connecting edge could be found.

Initargs

:vertex-1

Initform

(quote nil)

Readers

vertex-1 (generic function)

Slot: vertex-2

One of the vertexes for which no connecting edge could be found.

Initargs

:vertex-2

Initform

(quote nil)

Readers

vertex-2 (generic function)

Condition: graph-error ()

This is the root condition for errors that occur while running code in CL-Graph.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

error (condition)

Direct subclasses
Direct methods

graph (method)

Direct slots
Slot: graph
Initargs

:graph

Initform

(quote nil)

Readers

graph (generic function)

Condition: graph-vertex-not-found-error ()

This condition is signaled when a vertex can not be found in a graph.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

graph-error (condition)

Direct methods

vertex (method)

Direct slots
Slot: vertex

The vertex or value that could not be found in the graph.

Initargs

:vertex

Initform

(quote nil)

Readers

vertex (generic function)

Condition: graph-vertex-not-found-in-edge-error ()

This condition is signaled when a vertex can not be found in an edge.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

edge-error (condition)

Direct methods

vertex (method)

Direct slots
Slot: vertex
Initargs

:vertex

Initform

(quote nil)

Readers

vertex (generic function)


Previous: , Up: Exported definitions   [Contents][Index]

5.1.7 Classes

Class: basic-edge ()

This is the root class for all edges in CL-Graph.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses
Direct methods
Direct slots
Slot: edge-id

The ‘edge-id‘ is used internally by CL-Graph for bookkeeping.

Initargs

:edge-id

Initform

0

Readers

edge-id (generic function)

Writers

(setf edge-id) (generic function)

Slot: element
Initargs

:element, :value

Readers
  • element (generic function)
  • value (generic function)
Writers
  • (setf element) (generic function)
  • (setf value) (generic function)
Slot: tag

The ‘tag‘ is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]

Initargs

:tag

Readers

tag (generic function)

Writers

(setf tag) (generic function)

Slot: graph

The ‘graph‘ of which this edge is a part.

Initargs

:graph

Readers

graph (generic function)

Slot: color

The ‘color‘ is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]

Initargs

:color

Readers

color (generic function)

Writers

(setf color) (generic function)

Class: basic-graph ()

This is the root class for all graphs in CL-Graph.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses
Direct methods
Direct slots
Slot: graph-vertexes
Initargs

:graph-vertexes

Readers

graph-vertexes (generic function)

Slot: graph-edges
Initargs

:graph-edges

Readers

graph-edges (generic function)

Slot: largest-vertex-id
Initform

0

Readers

largest-vertex-id (generic function)

Slot: largest-edge-id
Initform

0

Readers

largest-edge-id (generic function)

Slot: vertex-class

The class of the vertexes in the graph. This must extend the base-class for vertexes of the graph type. E.g., all vertexes of a graph-container must extend graph-container-vertex.

Initargs

:vertex-class

Initform

(quote cl-graph:basic-vertex)

Readers

vertex-class (generic function)

Slot: directed-edge-class

The class used to create directed edges in the graph. This must extend the base-class for edges of the graph type and directed-edge-mixin. E.g., the directed-edge-class of a graph-container must extend graph-container-edge and directed-edge-mixin.

Initargs

:directed-edge-class

Initform

(quote cl-graph::basic-directed-edge)

Readers

directed-edge-class (generic function)

Slot: undirected-edge-class

The class used to create undirected edges in the graph. This must extend the base-class for edges of the graph type and undirected-edge-mixin. E.g., all undirected edges of a graph-container must extend graph-container-edge and undirected-edge-mixin.

Initargs

:undirected-edge-class

Initform

(quote cl-graph::basic-undirected-edge)

Readers

undirected-edge-class (generic function)

Slot: contains-directed-edge-p

Returns true if graph contains at least one directed edge. [?? Not sure if this is really kept up-to-date.]

Readers

contains-directed-edge-p (generic function)

Writers

(setf contains-directed-edge-p) (generic function)

Slot: contains-undirected-edge-p

Returns true if graph contains at least one undirected edge. [?? Not sure if this is really kept up-to-date.]

Readers

contains-undirected-edge-p (generic function)

Writers

(setf contains-undirected-edge-p) (generic function)

Slot: vertex-test
Initargs

:vertex-test

Initform

(function eq)

Readers

vertex-test (generic function)

Slot: vertex-key
Initargs

:vertex-key

Initform

(function identity)

Readers

vertex-key (generic function)

Slot: edge-test
Initargs

:edge-test

Initform

(function eq)

Readers

edge-test (generic function)

Slot: edge-key
Initargs

:edge-key

Initform

(function identity)

Readers

edge-key (generic function)

Slot: default-edge-type

The default edge type for the graph. This should be one of :undirected or :directed.

Initargs

:default-edge-type

Readers

default-edge-type (generic function)

Slot: default-edge-class

The default edge class for the graph.

Initargs

:default-edge-class

Readers

default-edge-class (generic function)

Direct Default Initargs
InitargValue
:initial-size25
Class: basic-vertex ()

This is the root class for all vertexes in CL-Graph.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

container-node-mixin (class)

Direct subclasses
Direct methods
Direct slots
Slot: depth-level

‘Depth-level‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Type

number

Initargs

:depth-level

Initform

0

Readers

depth-level (generic function)

Writers

(setf depth-level) (generic function)

Slot: vertex-id

‘Vertex-id‘ is used internally to keep track of vertexes.

Initargs

:vertex-id

Initform

0

Readers

vertex-id (generic function)

Slot: element

The ‘element‘ is the value that this vertex represents.

Initargs

:element

Readers
  • element (generic function)
  • value (generic function)
Writers
  • (setf element) (generic function)
  • (setf value) (generic function)
Slot: tag

The ‘tag‘ slot is used by some algorithms to keep track of which vertexes have been visited.

Initargs

:tag

Readers

tag (generic function)

Writers

(setf tag) (generic function)

Slot: graph

The graph in which this vertex is contained.

Initargs

:graph

Readers

graph (generic function)

Writers

(setf graph) (generic function)

Slot: color

The ‘color‘ slot is used by some algorithms for bookkeeping.

Initargs

:color

Readers

color (generic function)

Writers

(setf color) (generic function)

Slot: rank

The ‘rank‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Initargs

:rank

Readers

rank (generic function)

Writers

(setf rank) (generic function)

Slot: previous-node

‘Previous-node‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Initargs

:previous-node

Readers

previous-node (generic function)

Writers

(setf previous-node) (generic function)

Slot: next-node

‘Next-node‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Initargs

:next-node

Readers

next-node (generic function)

Writers

(setf next-node) (generic function)

Slot: discovery-time

‘Discovery-time‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Initargs

:discovery-time

Initform

-1

Readers

discovery-time (generic function)

Writers

(setf discovery-time) (generic function)

Slot: finish-time

‘Finish-time‘ is used by some algorithms for bookkeeping. [?? Should be in a mixin]

Initargs

:finish-time

Initform

-1

Readers

finish-time (generic function)

Writers

(setf finish-time) (generic function)

Class: directed-edge-mixin ()

This mixin class is used to indicate that an edge is directed.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses
Class: dot-attributes-mixin ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses
Direct methods
Direct slots
Slot: dot-attributes
Initargs

:dot-attributes

Readers

dot-attributes (generic function)

Writers

(setf dot-attributes) (generic function)

Class: dot-directed-edge ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses
Class: dot-edge ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses
Direct subclasses

dot-directed-edge (class)

Class: dot-edge-mixin ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses

dot-attributes-mixin (class)

Direct subclasses

dot-edge (class)

Direct methods
Class: dot-graph ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses
Class: dot-graph-mixin ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses

dot-attributes-mixin (class)

Direct subclasses

dot-graph (class)

Direct methods
Direct Default Initargs
InitargValue
:vertex-class(quote cl-graph:dot-vertex)
:directed-edge-class(quote cl-graph:dot-directed-edge)
:undirected-edge-class(quote cl-graph:dot-edge)
Class: dot-vertex ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses
Class: dot-vertex-mixin ()
Package

cl-graph

Source

graphviz-support.lisp (file)

Direct superclasses

dot-attributes-mixin (class)

Direct subclasses

dot-vertex (class)

Direct methods
Class: graph-container ()

A graph container is essentially an adjacency list graph representation [?? The Bad name comes from it being implemented with containers... ugh]

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses
  • container-uses-nodes-mixin (class)
  • basic-graph (class)
  • initial-contents-mixin (class)
  • non-associative-container-mixin (class)
  • iteratable-container-mixin (class)
Direct subclasses

dot-graph (class)

Direct methods
Direct slots
Slot: vertex-pair->edge
Initform

(metabang.cl-containers:make-container (quote metabang.cl-containers:simple-associative-container) :test (function equal))

Readers

vertex-pair->edge (generic function)

Direct Default Initargs
InitargValue
:vertex-class(quote cl-graph:graph-container-vertex)
:directed-edge-class(quote cl-graph:graph-container-directed-edge)
:undirected-edge-class(quote cl-graph:graph-container-undirected-edge)
Class: graph-container-directed-edge ()

A graph-container-directed-edge is both a directed-edge-mixin and a graph-container-edge.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses
Direct subclasses

weighted-directed-edge (class)

Direct methods

initialize-instance (method)

Class: graph-container-edge ()

This is the root class for edges in graph-containers. It adds vertex-1 and vertex-2 slots.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses

basic-edge (class)

Direct subclasses
Direct methods
Direct slots
Slot: vertex-1

‘Vertex-1‘ is one of the two vertexes that an edge connects. In a directed-edge, ‘vertex-1‘ is also the ‘source-vertex‘.

Initargs

:vertex-1

Readers

vertex-1 (generic function)

Slot: vertex-2

‘Vertex-2‘ is one of the two vertexes that an edge connects. In a directed edge, ‘vertex-2‘ is also the ‘target-vertex‘.

Initargs

:vertex-2

Readers

vertex-2 (generic function)

Class: graph-container-undirected-edge ()

A graph-container-undirected-edge is both an undirected-edge-mixin and a graph-container-edge.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses
Direct subclasses

weighted-undirected-edge (class)

Class: graph-container-vertex ()

A graph container vertex keeps track of its edges in the the vertex-edges slot. The storage for this defaults to a vector-container but can be changed using the vertex-edges-container-class initarg.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses

basic-vertex (class)

Direct subclasses

dot-vertex (class)

Direct methods
Direct slots
Slot: vertex-edges
Readers

vertex-edges (generic function)

Direct Default Initargs
InitargValue
:vertex-edges-container-class(quote metabang.cl-containers:vector-container)
Class: graph-matrix ()

Stub for matrix based graph. Not implemented.

Package

cl-graph

Source

graph-matrix.lisp (file)

Direct superclasses

basic-graph (class)

Direct methods
Direct slots
Slot: adjencency-matrix
Readers

adjencency-matrix (generic function)

Direct Default Initargs
InitargValue
:vertex-class(quote cl-graph:graph-matrix-vertex)
:undirected-edge-class(quote cl-graph:graph-matrix-edge)
Class: graph-matrix-edge ()

Stub for matrix based graph. Not implemented.

Package

cl-graph

Source

graph-matrix.lisp (file)

Direct superclasses

basic-edge (class)

Class: graph-matrix-vertex ()

Stub for matrix based graph. Not implemented.

Package

cl-graph

Source

graph-matrix.lisp (file)

Direct superclasses

basic-vertex (class)

Class: undirected-edge-mixin ()

This mixin class is used to indicate that an edge is undirected.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses

graph-container-undirected-edge (class)

Direct methods
Class: weighted-directed-edge ()

A weighted edge is a weighted-edge-mixin, a directed-edge-mixin, and a graph-container-edge.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses
Class: weighted-edge ()

A weighted edge is both a weighted-edge-mixin and a graph-container-edge.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses
Class: weighted-edge-mixin ()

This mixin class adds a ‘weight‘ slot to an edge.

Package

cl-graph

Source

graph.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses
Direct methods
  • weight (method)
  • weight (method)
Direct slots
Slot: weight

The value of the weight of this edge. Defaults to 1.0d0

Initargs

:weight

Initform

1.0d0

Readers

weight (generic function)

Writers

(setf weight) (generic function)

Class: weighted-undirected-edge ()

A weighted undirected edge is a weighted-edge-mixin, an undirected-edge-mixin, and a graph-container-edge.

Package

cl-graph

Source

graph-container.lisp (file)

Direct superclasses

Previous: , Up: Definitions   [Contents][Index]

5.2 Internal definitions


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.1 Special variables

Special Variable: *depth-first-search-timer*
Package

cl-graph

Source

graph-algorithms.lisp (file)

Special Variable: *dot-edge-attributes*
Package

cl-graph

Source

graphviz-support.lisp (file)

Special Variable: *dot-path*

Path to ‘dot‘

Package

cl-graph

Source

graphviz-support.lisp (file)

Special Variable: *dot-vertex-attributes*
Package

cl-graph

Source

graphviz-support.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.2 Macros

Macro: defpixel-inch-accessors NAME ATTR TYPE
Package

cl-graph

Source

graphviz-support.lisp (file)


Next: , Previous: , Up: Internal definitions   [Contents][Index]

5.2.3 Functions

Function: append-unique LIST1 LIST2
Package

cl-graph

Source

graph.lisp (file)

Function: copy-vertex-datum SEQUENCE

Return a copy of SEQUENCE which is EQUAL to SEQUENCE but not EQ.

Package

cl-graph

Source

SYS:SRC;CODE;SEQ.LISP (not found)

Function: dissoc-val-from-key-or-delete CONTAINER INDEX VAL
Package

cl-graph

Source

graph-container.lisp (file)

Function: format-dot-attributes OBJECT DOT-ATTRIBUTES STREAM
Package

cl-graph

Source

graphviz-support.lisp (file)

Function: get-nodelist-relatives NODE-LIST

Collects set of unique relatives of nodes in node-list.

Package

cl-graph

Source

graph.lisp (file)

Function: graph-search-for-cl-graph STATES GOAL-P SUCCESSORS COMBINER &key STATE= OLD-STATES NEW-STATE-FN

Find a state that satisfies goal-p. Start with states, and search according to successors and combiner. Don’t try the same state twice.

Package

cl-graph

Source

graph.lisp (file)

Function: make-vertex-datum &key (COLOR COLOR) (DEPTH DEPTH) (PARENT PARENT)
Package

cl-graph

Source

graph-algorithms.lisp (file)

Function: neighbors-to-children NEW-GRAPH ROOT &optional VISITED-LIST
Package

cl-graph

Source

graph.lisp (file)

Function: node-color STRUCTURE
Function: (setf node-color) VALUE STRUCTURE
Package

cl-graph

Source

graph-algorithms.lisp (file)

Function: node-depth STRUCTURE
Function: (setf node-depth) VALUE STRUCTURE
Package

cl-graph

Source

graph-algorithms.lisp (file)

Function: node-parent STRUCTURE
Function: (setf node-parent) VALUE STRUCTURE
Package

cl-graph

Source

graph-algorithms.lisp (file)

Function: remove-list ORIGINAL TARGET

Removes all elements in original from target.

Package

cl-graph

Source

graph.lisp (file)

Function: textify OBJECT
Package

cl-graph

Source

graphviz-support.lisp (file)


Previous: , Up: Internal definitions   [Contents][Index]

5.2.4 Generic functions

Generic Function: add-edge-to-vertex EDGE VERTEX

Attaches the edge ‘edge‘ to the vertex ‘vertex‘.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: add-edge-to-vertex (EDGE graph-container-edge) (VERTEX graph-container-vertex) around
Source

graph-container.lisp (file)

Method: add-edge-to-vertex (EDGE basic-edge) (VERTEX basic-vertex)
Source

graph.lisp (file)

Generic Function: add-edges-to-graph GRAPH EDGES &key IF-DUPLICATE-DO
Package

cl-graph

Source

api.lisp (file)

Methods
Method: add-edges-to-graph (GRAPH basic-graph) (EDGES list) &key IF-DUPLICATE-DO
Source

graph-algorithms.lisp (file)

Generic Function: adjencency-matrix OBJECT
Package

cl-graph

Methods
Method: adjencency-matrix (GRAPH-MATRIX graph-matrix)

automatically generated reader method

Source

graph-matrix.lisp (file)

Generic Function: assign-level VERTEX LEVEL

Sets the depth of ‘vertex‘ to level and then
recursively sets the depth of all of the children of ‘vertex‘ to (1+ level).

Package

cl-graph

Source

api.lisp (file)

Methods
Method: assign-level (NODE basic-vertex) (LEVEL number)
Source

graph.lisp (file)

Method: assign-level (GRAPH basic-graph) (LEVEL number)
Source

graph.lisp (file)

Generic Function: associate-edge-with-pair GRAPH EDGE
Package

cl-graph

Methods
Method: associate-edge-with-pair (GRAPH graph-container) (EDGE undirected-edge-mixin) after
Source

graph-container.lisp (file)

Method: associate-edge-with-pair (GRAPH graph-container) (EDGE graph-container-edge)
Source

graph-container.lisp (file)

Generic Function: breadth-first-search-graph GRAPH SOURCE
Package

cl-graph

Source

api.lisp (file)

Methods
Method: breadth-first-search-graph (GRAPH basic-graph) (SOURCE basic-vertex)
Source

graph-algorithms.lisp (file)

Method: breadth-first-search-graph (GRAPH basic-graph) SOURCE
Source

graph-algorithms.lisp (file)

Generic Function: breadth-first-visitor GRAPH SOURCE FN
Package

cl-graph

Source

api.lisp (file)

Methods
Method: breadth-first-visitor (GRAPH basic-graph) (SOURCE basic-vertex) FN
Source

graph-algorithms.lisp (file)

Method: breadth-first-visitor (GRAPH basic-graph) SOURCE FN
Source

graph-algorithms.lisp (file)

Generic Function: complete-links NEW-GRAPH OLD-GRAPH

Add edges between vertexes in the new-graph for
which the matching vertexes in the old-graph have edges. The vertex matching is done using ‘find-vertex‘.

Package

cl-graph

Source

api.lisp (file)

Generic Function: dfs-cross-edge-p EDGE
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs-cross-edge-p (EDGE graph-container-edge)
Source

graph-algorithms.lisp (file)

Generic Function: dfs-forward-edge-p EDGE
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs-forward-edge-p (EDGE graph-container-edge)
Source

graph-algorithms.lisp (file)

Generic Function: dfs-visit GRAPH U FN SORTER
Package

cl-graph

Source

api.lisp (file)

Methods
Method: dfs-visit (GRAPH graph-container) (U basic-vertex) FN SORTER
Source

graph-algorithms.lisp (file)

Generic Function: dissociate-edge-from-pair GRAPH EDGE
Package

cl-graph

Methods
Method: dissociate-edge-from-pair (GRAPH graph-container) (EDGE undirected-edge-mixin) after
Source

graph-container.lisp (file)

Method: dissociate-edge-from-pair (GRAPH graph-container) (EDGE graph-container-edge)
Source

graph-container.lisp (file)

Generic Function: edge-key OBJECT
Package

cl-graph

Methods
Method: edge-key (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: edge-test OBJECT
Package

cl-graph

Methods
Method: edge-test (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: ensure-valid-dot-attribute KEY OBJECT
Package

cl-graph

Source

api.lisp (file)

Methods
Method: ensure-valid-dot-attribute KEY (OBJECT dot-edge-mixin)
Source

graphviz-support.lisp (file)

Method: ensure-valid-dot-attribute KEY (OBJECT dot-vertex-mixin)
Source

graphviz-support.lisp (file)

Method: ensure-valid-dot-attribute KEY (OBJECT dot-graph-mixin)
Source

graphviz-support.lisp (file)

Generic Function: generate-assortative-graph-with-degree-distributions GENERATOR GRAPH EDGE-COUNT ASSORTATIVITY-MATRIX AVERAGE-DEGREES DEGREE-DISTRIBUTIONS VERTEX-LABELER &key
Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-gnm GENERATOR GRAPH N M &key

Generate a ’classic’ random graph G(n, m) with n vertexes and m edges.

Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-gnp GENERATOR GRAPH N P &key

Generate the Erd"os-R’enyi random graph G(n,
p). I.e., a graph with n vertexes where each possible edge appears with probability p. This implementation is from Efficient Generation of Large Random Networks (see batagelj-generation-2005 in doab).

Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-preferential-attachment-graph GENERATOR GRAPH SIZE KIND-MATRIX MINIMUM-DEGREE ASSORTATIVITY-MATRIX &key

Generate a Barabasi-Albert type scale free graph
with multiple vertex kinds.

The idea behind this implementation is from Efficient Generation of Large Random Networks (see batagelj-generation-2005 in moab).

Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-scale-free-graph GENERATOR GRAPH SIZE KIND-MATRIX ADD-EDGE-COUNT OTHER-VERTEX-KIND-SAMPLERS VERTEX-LABELER &key

Generates a ’scale-free’ graph using preferential
attachment – too damn slow.

Size is the number of vertexes; kind-matrix is as in generate-undirected-graph-via-assortativity-matrix, etc.; add-edge-count is the number of edges to add for each vertex; other-vertex-kind-samplers are confusing...; and vertex-labeler is used to create vertex elements (as in other generators).

Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-simple-preferential-attachment-graph GENERATOR GRAPH SIZE MINIMUM-DEGREE

Generate a simple scale-free graph using the
preferential attachment mechanism of Barabasi and Albert. The implementation is from Efficient Generation of Large Random Networks (see batagelj-generation-2005 in moab). Self-edges are possible.

Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-undirected-graph-via-assortativity-matrix GENERATOR GRAPH-CLASS SIZE EDGE-COUNT KIND-MATRIX ASSORTATIVITY-MATRIX VERTEX-LABELER &key

This generates a random graph with ’size’ vertexes.
The vertexes can be in multiple different classes and the number of vertexes in each class is specified in the ’kind-matrix’. If the matrix has all fixnums, then it specifies the counts and these should add up to the size. If the kind-matrix contains non-fixnums then the values are treated as ratios.

The assortativity-matrix specifies the number of edges between vertexes of different kinds.

The vertex-labeler is a function of two parameters: the vertex kind and the index. It should return whatever the ’value’ of the vertex ought to be.

Package

cl-graph

Source

api.lisp (file)

Generic Function: generate-undirected-graph-via-vertex-probabilities GENERATOR GRAPH-CLASS SIZE KIND-MATRIX PROBABILITY-MATRIX VERTEX-LABELER

Generate an Erd"os-R/’enyi like random graph
having multiple vertex kinds. See the function Gnp for the simple one vertex kind method.

Generator and graph-class specify the random number generator used and the class of the graph produced; Size the number of vertexes. Kind matrix is a vector of ratios specifying the distribution of vertex kinds {0 ... (1- k)}. The probability-matrix is a k x k matrix specifying the probability that two vertexes of the row-kind and the column-kind will have an edge between them. vertex-labeler is a function of two arguments (the kind and the vertex number) called to create values for vertexes. It will be called only once for each vertex created.

The clever sequential sampling technique in this implementation is from Efficient Generation of Large Random Networks (see batagelj-generation-2005 in moab).

Package

cl-graph

Source

api.lisp (file)

Generic Function: initialize-vertex-data GRAPH
Package

cl-graph

Source

api.lisp (file)

Methods
Method: initialize-vertex-data (GRAPH basic-graph)
Source

graph-algorithms.lisp (file)

Generic Function: largest-edge-id OBJECT
Package

cl-graph

Methods
Method: largest-edge-id (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: largest-vertex-id OBJECT
Package

cl-graph

Methods
Method: largest-vertex-id (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: make-edge-container GRAPH INITIAL-SIZE

Make-edge-container is called during graph creation
and can be used to create specialized containers to hold graph edges.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: make-edge-container (GRAPH graph-matrix) INITIAL-SIZE
Source

graph-matrix.lisp (file)

Method: make-edge-container (GRAPH graph-container) INITIAL-SIZE
Source

graph-container.lisp (file)

Generic Function: make-edge-for-graph GRAPH VERTEX-1 VERTEX-2 &key EDGE-TYPE EDGE-CLASS &allow-other-keys

It should not usually necessary to call this in
user code. Creates a new edge between vertex-1 and vertex-2 for the graph. If the edge-type and edge-class are not specified, they will be determined from the defaults of the graph.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: make-edge-for-graph (GRAPH basic-graph) (VERTEX-1 basic-vertex) (VERTEX-2 basic-vertex) &rest ARGS &key EDGE-TYPE EDGE-CLASS &allow-other-keys
Source

graph.lisp (file)

Generic Function: make-vertex-container GRAPH INITIAL-SIZE

Make-vertex-container is called during graph
creation and can be used to create specialized containers to hold graph vertexes.

Package

cl-graph

Source

api.lisp (file)

Methods
Method: make-vertex-container (GRAPH graph-matrix) INITIAL-SIZE
Source

graph-matrix.lisp (file)

Method: make-vertex-container (GRAPH graph-container) INITIAL-SIZE
Source

graph-container.lisp (file)

Generic Function: map-over-all-combinations-of-k-edges VERTEX K FN
Package

cl-graph

Source

api.lisp (file)

Methods
Method: map-over-all-combinations-of-k-edges (VERTEX basic-vertex) K FN
Source

graph-algorithms.lisp (file)

Method: map-over-all-combinations-of-k-edges (GRAPH basic-graph) K FN
Source

graph-algorithms.lisp (file)

Generic Function: map-over-all-combinations-of-k-vertexes GRAPH K FN
Package

cl-graph

Source

api.lisp (file)

Methods
Method: map-over-all-combinations-of-k-vertexes (GRAPH basic-graph) K FN
Source

graph-algorithms.lisp (file)

Generic Function: mst-find-set VERTEX
Package

cl-graph

Source

api.lisp (file)

Methods
Method: mst-find-set (VERTEX basic-vertex)
Source

graph-algorithms.lisp (file)

Generic Function: mst-link V1 V2
Package

cl-graph

Source

api.lisp (file)

Methods
Method: mst-link (V1 basic-vertex) (V2 basic-vertex)
Source

graph-algorithms.lisp (file)

Generic Function: mst-make-set VERTEX
Package

cl-graph

Source

api.lisp (file)

Methods
Method: mst-make-set (VERTEX basic-vertex)
Source

graph-algorithms.lisp (file)

Generic Function: mst-tree-union V1 V2
Package

cl-graph

Source

api.lisp (file)

Methods
Method: mst-tree-union (V1 basic-vertex) (V2 basic-vertex)
Source

graph-algorithms.lisp (file)

Generic Function: tag-edges EDGES

Sets the ‘tag‘ of all the edges of ‘thing‘ to true. [?? why does this exist?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: tag-edges (EDGES list)
Source

graph.lisp (file)

Generic Function: traverse-elements THING STYLE FN

WIP

Package

cl-graph

Source

api.lisp (file)

Methods
Method: traverse-elements (THING basic-graph) (STYLE symbol) FN
Source

graph.lisp (file)

Generic Function: traverse-elements-helper THING STYLE MARKER FN

WIP

Package

cl-graph

Source

api.lisp (file)

Methods
Method: traverse-elements-helper (THING basic-vertex) (STYLE (eql breadth)) MARKER FN
Source

graph.lisp (file)

Method: traverse-elements-helper (THING basic-vertex) (STYLE (eql depth)) MARKER FN
Source

graph.lisp (file)

Generic Function: untag-edges EDGES

Sets the ‘tag‘ of all the edges of ‘thing‘ to true. [?? why does this exist?]

Package

cl-graph

Source

api.lisp (file)

Methods
Method: untag-edges (EDGES list)
Source

graph.lisp (file)

Generic Function: value OBJECT
Generic Function: (setf value) NEW-VALUE OBJECT
Package

cl-graph

Methods
Method: value (BASIC-EDGE basic-edge)

automatically generated reader method

Source

graph.lisp (file)

Method: (setf value) NEW-VALUE (BASIC-EDGE basic-edge)

automatically generated writer method

Source

graph.lisp (file)

Method: value (BASIC-VERTEX basic-vertex)
Method: (setf value) NEW-VALUE (BASIC-VERTEX basic-vertex)

The ‘element‘ is the value that this vertex represents.

Source

graph.lisp (file)

Generic Function: vertex-edges OBJECT
Package

cl-graph

Methods
Method: vertex-edges (GRAPH-CONTAINER-VERTEX graph-container-vertex)

automatically generated reader method

Source

graph-container.lisp (file)

Generic Function: vertex-key OBJECT
Package

cl-graph

Methods
Method: vertex-key (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: vertex-pair->edge OBJECT
Package

cl-graph

Methods
Method: vertex-pair->edge (GRAPH-CONTAINER graph-container)

automatically generated reader method

Source

graph-container.lisp (file)

Generic Function: vertex-test OBJECT
Package

cl-graph

Methods
Method: vertex-test (BASIC-GRAPH basic-graph)

automatically generated reader method

Source

graph.lisp (file)

Generic Function: write-name-for-dot ATTRIBUTE STREAM
Package

cl-graph

Source

api.lisp (file)

Methods
Method: write-name-for-dot (ATTRIBUTE (eql url)) STREAM
Source

graphviz-support.lisp (file)

Method: write-name-for-dot ATTRIBUTE STREAM
Source

graphviz-support.lisp (file)


Previous: , Up: Top   [Contents][Index]

Appendix A Indexes


Next: , Previous: , Up: Indexes   [Contents][Index]

A.1 Concepts

Jump to:   C   F   L   M   O  
Index Entry  Section

C
cl-graph.asd: The cl-graph<dot>asd file
cl-graph/COPYING: The cl-graph/copying file
cl-graph/dev: The cl-graph/dev module
cl-graph/dev/api.lisp: The cl-graph/dev/api<dot>lisp file
cl-graph/dev/graph-algorithms.lisp: The cl-graph/dev/graph-algorithms<dot>lisp file
cl-graph/dev/graph-container.lisp: The cl-graph/dev/graph-container<dot>lisp file
cl-graph/dev/graph-matrix.lisp: The cl-graph/dev/graph-matrix<dot>lisp file
cl-graph/dev/graph.lisp: The cl-graph/dev/graph<dot>lisp file
cl-graph/dev/graphviz: The cl-graph/dev/graphviz module
cl-graph/dev/graphviz/graphviz-support.lisp: The cl-graph/dev/graphviz/graphviz-support<dot>lisp file
cl-graph/dev/macros.lisp: The cl-graph/dev/macros<dot>lisp file
cl-graph/dev/notes.text: The cl-graph/dev/notes<dot>text file
cl-graph/dev/package.lisp: The cl-graph/dev/package<dot>lisp file
cl-graph/website: The cl-graph/website module
cl-graph/website/source: The cl-graph/website/source module
cl-graph/website/source/index.mmd: The cl-graph/website/source/index<dot>mmd file

F
File, Lisp, cl-graph.asd: The cl-graph<dot>asd file
File, Lisp, cl-graph/dev/api.lisp: The cl-graph/dev/api<dot>lisp file
File, Lisp, cl-graph/dev/graph-algorithms.lisp: The cl-graph/dev/graph-algorithms<dot>lisp file
File, Lisp, cl-graph/dev/graph-container.lisp: The cl-graph/dev/graph-container<dot>lisp file
File, Lisp, cl-graph/dev/graph-matrix.lisp: The cl-graph/dev/graph-matrix<dot>lisp file
File, Lisp, cl-graph/dev/graph.lisp: The cl-graph/dev/graph<dot>lisp file
File, Lisp, cl-graph/dev/graphviz/graphviz-support.lisp: The cl-graph/dev/graphviz/graphviz-support<dot>lisp file
File, Lisp, cl-graph/dev/macros.lisp: The cl-graph/dev/macros<dot>lisp file
File, Lisp, cl-graph/dev/package.lisp: The cl-graph/dev/package<dot>lisp file
File, other, cl-graph/COPYING: The cl-graph/copying file
File, other, cl-graph/dev/notes.text: The cl-graph/dev/notes<dot>text file
File, other, cl-graph/website/source/index.mmd: The cl-graph/website/source/index<dot>mmd file

L
Lisp File, cl-graph.asd: The cl-graph<dot>asd file
Lisp File, cl-graph/dev/api.lisp: The cl-graph/dev/api<dot>lisp file
Lisp File, cl-graph/dev/graph-algorithms.lisp: The cl-graph/dev/graph-algorithms<dot>lisp file
Lisp File, cl-graph/dev/graph-container.lisp: The cl-graph/dev/graph-container<dot>lisp file
Lisp File, cl-graph/dev/graph-matrix.lisp: The cl-graph/dev/graph-matrix<dot>lisp file
Lisp File, cl-graph/dev/graph.lisp: The cl-graph/dev/graph<dot>lisp file
Lisp File, cl-graph/dev/graphviz/graphviz-support.lisp: The cl-graph/dev/graphviz/graphviz-support<dot>lisp file
Lisp File, cl-graph/dev/macros.lisp: The cl-graph/dev/macros<dot>lisp file
Lisp File, cl-graph/dev/package.lisp: The cl-graph/dev/package<dot>lisp file

M
Module, cl-graph/dev: The cl-graph/dev module
Module, cl-graph/dev/graphviz: The cl-graph/dev/graphviz module
Module, cl-graph/website: The cl-graph/website module
Module, cl-graph/website/source: The cl-graph/website/source module

O
Other File, cl-graph/COPYING: The cl-graph/copying file
Other File, cl-graph/dev/notes.text: The cl-graph/dev/notes<dot>text file
Other File, cl-graph/website/source/index.mmd: The cl-graph/website/source/index<dot>mmd file

Jump to:   C   F   L   M   O  

Next: , Previous: , Up: Indexes   [Contents][Index]

A.2 Functions

Jump to:   (  
A   B   C   D   E   F   G   H   I   L   M   N   O   P   R   S   T   U   V   W  
Index Entry  Section

(
(setf color): Exported generic functions
(setf color): Exported generic functions
(setf color): Exported generic functions
(setf contains-directed-edge-p): Exported generic functions
(setf contains-directed-edge-p): Exported generic functions
(setf contains-undirected-edge-p): Exported generic functions
(setf contains-undirected-edge-p): Exported generic functions
(setf depth-level): Exported generic functions
(setf depth-level): Exported generic functions
(setf discovery-time): Exported generic functions
(setf discovery-time): Exported generic functions
(setf dot-attribute-value): Exported generic functions
(setf dot-attribute-value): Exported generic functions
(setf dot-attribute-value): Exported generic functions
(setf dot-attributes): Exported generic functions
(setf dot-attributes): Exported generic functions
(setf edge-id): Exported generic functions
(setf edge-id): Exported generic functions
(setf finish-time): Exported generic functions
(setf finish-time): Exported generic functions
(setf graph): Exported generic functions
(setf graph): Exported generic functions
(setf height-in-pixels): Exported generic functions
(setf height-in-pixels): Exported generic functions
(setf next-node): Exported generic functions
(setf next-node): Exported generic functions
(setf node-color): Internal functions
(setf node-depth): Internal functions
(setf node-parent): Internal functions
(setf previous-node): Exported generic functions
(setf previous-node): Exported generic functions
(setf rank): Exported generic functions
(setf rank): Exported generic functions
(setf value): Internal generic functions
(setf value): Internal generic functions
(setf value): Internal generic functions
(setf width-in-pixels): Exported generic functions
(setf width-in-pixels): Exported generic functions

A
add-edge: Exported generic functions
add-edge: Exported generic functions
add-edge: Exported generic functions
add-edge-between-vertexes: Exported generic functions
add-edge-between-vertexes: Exported generic functions
add-edge-between-vertexes: Exported generic functions
add-edge-to-vertex: Internal generic functions
add-edge-to-vertex: Internal generic functions
add-edge-to-vertex: Internal generic functions
add-edges-to-graph: Internal generic functions
add-edges-to-graph: Internal generic functions
add-vertex: Exported generic functions
add-vertex: Exported generic functions
add-vertex: Exported generic functions
add-vertex: Exported generic functions
adjacentp: Exported generic functions
adjacentp: Exported generic functions
adjacentp: Exported generic functions
adjencency-matrix: Internal generic functions
adjencency-matrix: Internal generic functions
any-undirected-cycle-p: Exported generic functions
any-undirected-cycle-p: Exported generic functions
append-unique: Internal functions
assign-level: Internal generic functions
assign-level: Internal generic functions
assign-level: Internal generic functions
associate-edge-with-pair: Internal generic functions
associate-edge-with-pair: Internal generic functions
associate-edge-with-pair: Internal generic functions
assortativity-coefficient: Exported generic functions

B
breadth-first-search-graph: Internal generic functions
breadth-first-search-graph: Internal generic functions
breadth-first-search-graph: Internal generic functions
breadth-first-visitor: Internal generic functions
breadth-first-visitor: Internal generic functions
breadth-first-visitor: Internal generic functions

C
child-vertexes: Exported generic functions
child-vertexes: Exported generic functions
color: Exported generic functions
color: Exported generic functions
color: Exported generic functions
Compiler Macro, vertex-count: Exported compiler macros
complete-links: Internal generic functions
connected-component-count: Exported generic functions
connected-component-count: Exported generic functions
connected-components: Exported generic functions
connected-components: Exported generic functions
connected-graph-p: Exported generic functions
connected-graph-p: Exported generic functions
contains-directed-edge-p: Exported generic functions
contains-directed-edge-p: Exported generic functions
contains-undirected-edge-p: Exported generic functions
contains-undirected-edge-p: Exported generic functions
copy-vertex-datum: Internal functions

D
default-edge-class: Exported generic functions
default-edge-class: Exported generic functions
default-edge-type: Exported generic functions
default-edge-type: Exported generic functions
defpixel-inch-accessors: Internal macros
delete-all-edges: Exported generic functions
delete-all-edges: Exported generic functions
delete-all-edges: Exported generic functions
delete-edge: Exported generic functions
delete-edge: Exported generic functions
delete-edge: Exported generic functions
delete-edge-between-vertexes: Exported generic functions
delete-edge-between-vertexes: Exported generic functions
delete-vertex: Exported generic functions
delete-vertex: Exported generic functions
delete-vertex: Exported generic functions
delete-vertex: Exported generic functions
depth: Exported generic functions
depth: Exported generic functions
depth-level: Exported generic functions
depth-level: Exported generic functions
dfs: Exported generic functions
dfs: Exported generic functions
dfs: Exported generic functions
dfs-back-edge-p: Exported generic functions
dfs-back-edge-p: Exported generic functions
dfs-cross-edge-p: Internal generic functions
dfs-cross-edge-p: Internal generic functions
dfs-edge-type: Exported generic functions
dfs-edge-type: Exported generic functions
dfs-forward-edge-p: Internal generic functions
dfs-forward-edge-p: Internal generic functions
dfs-tree-edge-p: Exported generic functions
dfs-tree-edge-p: Exported generic functions
dfs-visit: Internal generic functions
dfs-visit: Internal generic functions
directed-edge-class: Exported generic functions
directed-edge-class: Exported generic functions
directed-edge-p: Exported generic functions
directed-edge-p: Exported generic functions
discovery-time: Exported generic functions
discovery-time: Exported generic functions
dissoc-val-from-key-or-delete: Internal functions
dissociate-edge-from-pair: Internal generic functions
dissociate-edge-from-pair: Internal generic functions
dissociate-edge-from-pair: Internal generic functions
dot-attribute-value: Exported generic functions
dot-attribute-value: Exported generic functions
dot-attributes: Exported generic functions
dot-attributes: Exported generic functions

E
edge: Exported generic functions
edge: Exported generic functions
edge->dot: Exported generic functions
edge->dot: Exported generic functions
edge->dot: Exported generic functions
edge-count: Exported generic functions
edge-count: Exported generic functions
edge-count: Exported generic functions
edge-count: Exported generic functions
edge-id: Exported generic functions
edge-id: Exported generic functions
edge-key: Internal generic functions
edge-key: Internal generic functions
edge-lessp-by-direction: Exported generic functions
edge-lessp-by-direction: Exported generic functions
edge-lessp-by-weight: Exported generic functions
edge-lessp-by-weight: Exported generic functions
edge-test: Internal generic functions
edge-test: Internal generic functions
edges: Exported generic functions
edges: Exported generic functions
edges: Exported generic functions
ensure-valid-dot-attribute: Internal generic functions
ensure-valid-dot-attribute: Internal generic functions
ensure-valid-dot-attribute: Internal generic functions
ensure-valid-dot-attribute: Internal generic functions

F
find-connected-components: Exported generic functions
find-connected-components: Exported generic functions
find-edge: Exported generic functions
find-edge: Exported generic functions
find-edge-between-vertexes: Exported generic functions
find-edge-between-vertexes: Exported generic functions
find-edge-between-vertexes: Exported generic functions
find-edge-between-vertexes-if: Exported generic functions
find-edge-between-vertexes-if: Exported generic functions
find-edge-between-vertexes-if: Exported generic functions
find-edge-if: Exported generic functions
find-edge-if: Exported generic functions
find-edges-if: Exported generic functions
find-edges-if: Exported generic functions
find-vertex: Exported generic functions
find-vertex: Exported generic functions
find-vertex: Exported generic functions
find-vertex: Exported generic functions
find-vertex-if: Exported generic functions
find-vertex-if: Exported generic functions
find-vertex-if: Exported generic functions
find-vertexes-if: Exported generic functions
find-vertexes-if: Exported generic functions
finish-time: Exported generic functions
finish-time: Exported generic functions
force-undirected: Exported generic functions
force-undirected: Exported generic functions
format-dot-attributes: Internal functions
Function, (setf node-color): Internal functions
Function, (setf node-depth): Internal functions
Function, (setf node-parent): Internal functions
Function, append-unique: Internal functions
Function, copy-vertex-datum: Internal functions
Function, dissoc-val-from-key-or-delete: Internal functions
Function, format-dot-attributes: Internal functions
Function, get-nodelist-relatives: Internal functions
Function, get-transitive-closure: Exported functions
Function, graph-search-for-cl-graph: Internal functions
Function, make-vertex-datum: Internal functions
Function, map-paths: Exported functions
Function, map-shortest-paths: Exported functions
Function, neighbors-to-children: Internal functions
Function, node-color: Internal functions
Function, node-depth: Internal functions
Function, node-parent: Internal functions
Function, print-dot-key-value: Exported functions
Function, remove-list: Internal functions
Function, textify: Internal functions

G
generate-assortative-graph-with-degree-distributions: Internal generic functions
generate-directed-free-tree: Exported generic functions
generate-directed-free-tree: Exported generic functions
generate-gnm: Internal generic functions
generate-gnp: Internal generic functions
generate-preferential-attachment-graph: Internal generic functions
generate-scale-free-graph: Internal generic functions
generate-simple-preferential-attachment-graph: Internal generic functions
generate-undirected-graph-via-assortativity-matrix: Internal generic functions
generate-undirected-graph-via-vertex-probabilities: Internal generic functions
Generic Function, (setf color): Exported generic functions
Generic Function, (setf contains-directed-edge-p): Exported generic functions
Generic Function, (setf contains-undirected-edge-p): Exported generic functions
Generic Function, (setf depth-level): Exported generic functions
Generic Function, (setf discovery-time): Exported generic functions
Generic Function, (setf dot-attribute-value): Exported generic functions
Generic Function, (setf dot-attributes): Exported generic functions
Generic Function, (setf edge-id): Exported generic functions
Generic Function, (setf finish-time): Exported generic functions
Generic Function, (setf graph): Exported generic functions
Generic Function, (setf height-in-pixels): Exported generic functions
Generic Function, (setf next-node): Exported generic functions
Generic Function, (setf previous-node): Exported generic functions
Generic Function, (setf rank): Exported generic functions
Generic Function, (setf value): Internal generic functions
Generic Function, (setf width-in-pixels): Exported generic functions
Generic Function, add-edge: Exported generic functions
Generic Function, add-edge-between-vertexes: Exported generic functions
Generic Function, add-edge-to-vertex: Internal generic functions
Generic Function, add-edges-to-graph: Internal generic functions
Generic Function, add-vertex: Exported generic functions
Generic Function, adjacentp: Exported generic functions
Generic Function, adjencency-matrix: Internal generic functions
Generic Function, any-undirected-cycle-p: Exported generic functions
Generic Function, assign-level: Internal generic functions
Generic Function, associate-edge-with-pair: Internal generic functions
Generic Function, assortativity-coefficient: Exported generic functions
Generic Function, breadth-first-search-graph: Internal generic functions
Generic Function, breadth-first-visitor: Internal generic functions
Generic Function, child-vertexes: Exported generic functions
Generic Function, color: Exported generic functions
Generic Function, complete-links: Internal generic functions
Generic Function, connected-component-count: Exported generic functions
Generic Function, connected-components: Exported generic functions
Generic Function, connected-graph-p: Exported generic functions
Generic Function, contains-directed-edge-p: Exported generic functions
Generic Function, contains-undirected-edge-p: Exported generic functions
Generic Function, default-edge-class: Exported generic functions
Generic Function, default-edge-type: Exported generic functions
Generic Function, delete-all-edges: Exported generic functions
Generic Function, delete-edge: Exported generic functions
Generic Function, delete-edge-between-vertexes: Exported generic functions
Generic Function, delete-vertex: Exported generic functions
Generic Function, depth: Exported generic functions
Generic Function, depth-level: Exported generic functions
Generic Function, dfs: Exported generic functions
Generic Function, dfs-back-edge-p: Exported generic functions
Generic Function, dfs-cross-edge-p: Internal generic functions
Generic Function, dfs-edge-type: Exported generic functions
Generic Function, dfs-forward-edge-p: Internal generic functions
Generic Function, dfs-tree-edge-p: Exported generic functions
Generic Function, dfs-visit: Internal generic functions
Generic Function, directed-edge-class: Exported generic functions
Generic Function, directed-edge-p: Exported generic functions
Generic Function, discovery-time: Exported generic functions
Generic Function, dissociate-edge-from-pair: Internal generic functions
Generic Function, dot-attribute-value: Exported generic functions
Generic Function, dot-attributes: Exported generic functions
Generic Function, edge: Exported generic functions
Generic Function, edge->dot: Exported generic functions
Generic Function, edge-count: Exported generic functions
Generic Function, edge-id: Exported generic functions
Generic Function, edge-key: Internal generic functions
Generic Function, edge-lessp-by-direction: Exported generic functions
Generic Function, edge-lessp-by-weight: Exported generic functions
Generic Function, edge-test: Internal generic functions
Generic Function, edges: Exported generic functions
Generic Function, ensure-valid-dot-attribute: Internal generic functions
Generic Function, find-connected-components: Exported generic functions
Generic Function, find-edge: Exported generic functions
Generic Function, find-edge-between-vertexes: Exported generic functions
Generic Function, find-edge-between-vertexes-if: Exported generic functions
Generic Function, find-edge-if: Exported generic functions
Generic Function, find-edges-if: Exported generic functions
Generic Function, find-vertex: Exported generic functions
Generic Function, find-vertex-if: Exported generic functions
Generic Function, find-vertexes-if: Exported generic functions
Generic Function, finish-time: Exported generic functions
Generic Function, force-undirected: Exported generic functions
Generic Function, generate-assortative-graph-with-degree-distributions: Internal generic functions
Generic Function, generate-directed-free-tree: Exported generic functions
Generic Function, generate-gnm: Internal generic functions
Generic Function, generate-gnp: Internal generic functions
Generic Function, generate-preferential-attachment-graph: Internal generic functions
Generic Function, generate-scale-free-graph: Internal generic functions
Generic Function, generate-simple-preferential-attachment-graph: Internal generic functions
Generic Function, generate-undirected-graph-via-assortativity-matrix: Internal generic functions
Generic Function, generate-undirected-graph-via-vertex-probabilities: Internal generic functions
Generic Function, graph: Exported generic functions
Generic Function, graph->dot: Exported generic functions
Generic Function, graph->dot-external: Exported generic functions
Generic Function, graph->dot-properties: Exported generic functions
Generic Function, graph-edge-mixture-matrix: Exported generic functions
Generic Function, graph-edges: Exported generic functions
Generic Function, graph-mixing-matrix: Exported generic functions
Generic Function, graph-roots: Exported generic functions
Generic Function, graph-vertexes: Exported generic functions
Generic Function, has-children-p: Exported generic functions
Generic Function, has-parent-p: Exported generic functions
Generic Function, height-in-pixels: Exported generic functions
Generic Function, in-cycle-p: Exported generic functions
Generic Function, in-undirected-cycle-p: Exported generic functions
Generic Function, initialize-vertex-data: Internal generic functions
Generic Function, iterate-edges: Exported generic functions
Generic Function, iterate-neighbors: Exported generic functions
Generic Function, iterate-parents: Exported generic functions
Generic Function, iterate-source-edges: Exported generic functions
Generic Function, iterate-target-edges: Exported generic functions
Generic Function, iterate-vertexes: Exported generic functions
Generic Function, largest-edge-id: Internal generic functions
Generic Function, largest-vertex-id: Internal generic functions
Generic Function, make-edge-container: Internal generic functions
Generic Function, make-edge-for-graph: Internal generic functions
Generic Function, make-filtered-graph: Exported generic functions
Generic Function, make-graph: Exported generic functions
Generic Function, make-graph-from-vertexes: Exported generic functions
Generic Function, make-vertex-container: Internal generic functions
Generic Function, make-vertex-edges-container: Exported generic functions
Generic Function, make-vertex-for-graph: Exported generic functions
Generic Function, map-over-all-combinations-of-k-edges: Internal generic functions
Generic Function, map-over-all-combinations-of-k-vertexes: Internal generic functions
Generic Function, minimum-spanning-tree: Exported generic functions
Generic Function, mst-find-set: Internal generic functions
Generic Function, mst-link: Internal generic functions
Generic Function, mst-make-set: Internal generic functions
Generic Function, mst-tree-union: Internal generic functions
Generic Function, neighbor-vertexes: Exported generic functions
Generic Function, next-node: Exported generic functions
Generic Function, number-of-neighbors: Exported generic functions
Generic Function, other-vertex: Exported generic functions
Generic Function, out-edge-for-vertex-p: Exported generic functions
Generic Function, parent-vertexes: Exported generic functions
Generic Function, previous-node: Exported generic functions
Generic Function, project-bipartite-graph: Exported generic functions
Generic Function, rank: Exported generic functions
Generic Function, renumber-edges: Exported generic functions
Generic Function, renumber-vertexes: Exported generic functions
Generic Function, replace-vertex: Exported generic functions
Generic Function, rooted-dfs: Exported generic functions
Generic Function, rootp: Exported generic functions
Generic Function, search-for-vertex: Exported generic functions
Generic Function, source-edge-count: Exported generic functions
Generic Function, source-edges: Exported generic functions
Generic Function, source-vertex: Exported generic functions
Generic Function, subgraph-containing: Exported generic functions
Generic Function, tag-all-edges: Exported generic functions
Generic Function, tag-edges: Internal generic functions
Generic Function, tagged-edge-p: Exported generic functions
Generic Function, target-edge-count: Exported generic functions
Generic Function, target-edges: Exported generic functions
Generic Function, target-vertex: Exported generic functions
Generic Function, topological-sort: Exported generic functions
Generic Function, traverse-elements: Internal generic functions
Generic Function, traverse-elements-helper: Internal generic functions
Generic Function, undirected-edge-class: Exported generic functions
Generic Function, undirected-edge-p: Exported generic functions
Generic Function, untag-all-edges: Exported generic functions
Generic Function, untag-edges: Internal generic functions
Generic Function, untagged-edge-p: Exported generic functions
Generic Function, value: Internal generic functions
Generic Function, vertex: Exported generic functions
Generic Function, vertex-1: Exported generic functions
Generic Function, vertex-2: Exported generic functions
Generic Function, vertex->dot: Exported generic functions
Generic Function, vertex-class: Exported generic functions
Generic Function, vertex-count: Exported generic functions
Generic Function, vertex-edges: Internal generic functions
Generic Function, vertex-id: Exported generic functions
Generic Function, vertex-key: Internal generic functions
Generic Function, vertex-pair->edge: Internal generic functions
Generic Function, vertex-test: Internal generic functions
Generic Function, vertexes: Exported generic functions
Generic Function, vertices-share-edge-p: Exported generic functions
Generic Function, width-in-pixels: Exported generic functions
Generic Function, write-name-for-dot: Internal generic functions
get-nodelist-relatives: Internal functions
get-transitive-closure: Exported functions
graph: Exported generic functions
graph: Exported generic functions
graph: Exported generic functions
graph: Exported generic functions
graph->dot: Exported generic functions
graph->dot: Exported generic functions
graph->dot: Exported generic functions
graph->dot: Exported generic functions
graph->dot: Exported generic functions
graph->dot: Exported generic functions
graph->dot-external: Exported generic functions
graph->dot-external: Exported generic functions
graph->dot-properties: Exported generic functions
graph->dot-properties: Exported generic functions
graph->dot-properties: Exported generic functions
graph-edge-mixture-matrix: Exported generic functions
graph-edges: Exported generic functions
graph-edges: Exported generic functions
graph-mixing-matrix: Exported generic functions
graph-roots: Exported generic functions
graph-roots: Exported generic functions
graph-search-for-cl-graph: Internal functions
graph-vertexes: Exported generic functions
graph-vertexes: Exported generic functions

H
has-children-p: Exported generic functions
has-children-p: Exported generic functions
has-parent-p: Exported generic functions
has-parent-p: Exported generic functions
height-in-pixels: Exported generic functions
height-in-pixels: Exported generic functions

I
in-cycle-p: Exported generic functions
in-cycle-p: Exported generic functions
in-cycle-p: Exported generic functions
in-undirected-cycle-p: Exported generic functions
in-undirected-cycle-p: Exported generic functions
initialize-vertex-data: Internal generic functions
initialize-vertex-data: Internal generic functions
iterate-edges: Exported generic functions
iterate-edges: Exported generic functions
iterate-edges: Exported generic functions
iterate-neighbors: Exported generic functions
iterate-neighbors: Exported generic functions
iterate-parents: Exported generic functions
iterate-parents: Exported generic functions
iterate-source-edges: Exported generic functions
iterate-source-edges: Exported generic functions
iterate-target-edges: Exported generic functions
iterate-target-edges: Exported generic functions
iterate-vertexes: Exported generic functions
iterate-vertexes: Exported generic functions
iterate-vertexes: Exported generic functions

L
largest-edge-id: Internal generic functions
largest-edge-id: Internal generic functions
largest-vertex-id: Internal generic functions
largest-vertex-id: Internal generic functions

M
Macro, defpixel-inch-accessors: Internal macros
Macro, with-changing-vertex: Exported macros
make-edge-container: Internal generic functions
make-edge-container: Internal generic functions
make-edge-container: Internal generic functions
make-edge-for-graph: Internal generic functions
make-edge-for-graph: Internal generic functions
make-filtered-graph: Exported generic functions
make-graph: Exported generic functions
make-graph: Exported generic functions
make-graph-from-vertexes: Exported generic functions
make-vertex-container: Internal generic functions
make-vertex-container: Internal generic functions
make-vertex-container: Internal generic functions
make-vertex-datum: Internal functions
make-vertex-edges-container: Exported generic functions
make-vertex-edges-container: Exported generic functions
make-vertex-for-graph: Exported generic functions
make-vertex-for-graph: Exported generic functions
map-over-all-combinations-of-k-edges: Internal generic functions
map-over-all-combinations-of-k-edges: Internal generic functions
map-over-all-combinations-of-k-edges: Internal generic functions
map-over-all-combinations-of-k-vertexes: Internal generic functions
map-over-all-combinations-of-k-vertexes: Internal generic functions
map-paths: Exported functions
map-shortest-paths: Exported functions
Method, (setf color): Exported generic functions
Method, (setf color): Exported generic functions
Method, (setf contains-directed-edge-p): Exported generic functions
Method, (setf contains-undirected-edge-p): Exported generic functions
Method, (setf depth-level): Exported generic functions
Method, (setf discovery-time): Exported generic functions
Method, (setf dot-attribute-value): Exported generic functions
Method, (setf dot-attribute-value): Exported generic functions
Method, (setf dot-attributes): Exported generic functions
Method, (setf edge-id): Exported generic functions
Method, (setf finish-time): Exported generic functions
Method, (setf graph): Exported generic functions
Method, (setf height-in-pixels): Exported generic functions
Method, (setf next-node): Exported generic functions
Method, (setf previous-node): Exported generic functions
Method, (setf rank): Exported generic functions
Method, (setf value): Internal generic functions
Method, (setf value): Internal generic functions
Method, (setf width-in-pixels): Exported generic functions
Method, add-edge: Exported generic functions
Method, add-edge: Exported generic functions
Method, add-edge-between-vertexes: Exported generic functions
Method, add-edge-between-vertexes: Exported generic functions
Method, add-edge-to-vertex: Internal generic functions
Method, add-edge-to-vertex: Internal generic functions
Method, add-edges-to-graph: Internal generic functions
Method, add-vertex: Exported generic functions
Method, add-vertex: Exported generic functions
Method, add-vertex: Exported generic functions
Method, adjacentp: Exported generic functions
Method, adjacentp: Exported generic functions
Method, adjencency-matrix: Internal generic functions
Method, any-undirected-cycle-p: Exported generic functions
Method, assign-level: Internal generic functions
Method, assign-level: Internal generic functions
Method, associate-edge-with-pair: Internal generic functions
Method, associate-edge-with-pair: Internal generic functions
Method, breadth-first-search-graph: Internal generic functions
Method, breadth-first-search-graph: Internal generic functions
Method, breadth-first-visitor: Internal generic functions
Method, breadth-first-visitor: Internal generic functions
Method, child-vertexes: Exported generic functions
Method, color: Exported generic functions
Method, color: Exported generic functions
Method, connected-component-count: Exported generic functions
Method, connected-components: Exported generic functions
Method, connected-graph-p: Exported generic functions
Method, contains-directed-edge-p: Exported generic functions
Method, contains-undirected-edge-p: Exported generic functions
Method, default-edge-class: Exported generic functions
Method, default-edge-type: Exported generic functions
Method, delete-all-edges: Exported generic functions
Method, delete-all-edges: Exported generic functions
Method, delete-edge: Exported generic functions
Method, delete-edge: Exported generic functions
Method, delete-edge-between-vertexes: Exported generic functions
Method, delete-vertex: Exported generic functions
Method, delete-vertex: Exported generic functions
Method, delete-vertex: Exported generic functions
Method, depth: Exported generic functions
Method, depth-level: Exported generic functions
Method, dfs: Exported generic functions
Method, dfs: Exported generic functions
Method, dfs-back-edge-p: Exported generic functions
Method, dfs-cross-edge-p: Internal generic functions
Method, dfs-edge-type: Exported generic functions
Method, dfs-forward-edge-p: Internal generic functions
Method, dfs-tree-edge-p: Exported generic functions
Method, dfs-visit: Internal generic functions
Method, directed-edge-class: Exported generic functions
Method, directed-edge-p: Exported generic functions
Method, discovery-time: Exported generic functions
Method, dissociate-edge-from-pair: Internal generic functions
Method, dissociate-edge-from-pair: Internal generic functions
Method, dot-attribute-value: Exported generic functions
Method, dot-attributes: Exported generic functions
Method, edge: Exported generic functions
Method, edge->dot: Exported generic functions
Method, edge->dot: Exported generic functions
Method, edge-count: Exported generic functions
Method, edge-count: Exported generic functions
Method, edge-count: Exported generic functions
Method, edge-id: Exported generic functions
Method, edge-key: Internal generic functions
Method, edge-lessp-by-direction: Exported generic functions
Method, edge-lessp-by-weight: Exported generic functions
Method, edge-test: Internal generic functions
Method, edges: Exported generic functions
Method, edges: Exported generic functions
Method, ensure-valid-dot-attribute: Internal generic functions
Method, ensure-valid-dot-attribute: Internal generic functions
Method, ensure-valid-dot-attribute: Internal generic functions
Method, find-connected-components: Exported generic functions
Method, find-edge: Exported generic functions
Method, find-edge-between-vertexes: Exported generic functions
Method, find-edge-between-vertexes: Exported generic functions
Method, find-edge-between-vertexes-if: Exported generic functions
Method, find-edge-between-vertexes-if: Exported generic functions
Method, find-edge-if: Exported generic functions
Method, find-edges-if: Exported generic functions
Method, find-vertex: Exported generic functions
Method, find-vertex: Exported generic functions
Method, find-vertex: Exported generic functions
Method, find-vertex-if: Exported generic functions
Method, find-vertex-if: Exported generic functions
Method, find-vertexes-if: Exported generic functions
Method, finish-time: Exported generic functions
Method, force-undirected: Exported generic functions
Method, generate-directed-free-tree: Exported generic functions
Method, graph: Exported generic functions
Method, graph: Exported generic functions
Method, graph: Exported generic functions
Method, graph->dot: Exported generic functions
Method, graph->dot: Exported generic functions
Method, graph->dot: Exported generic functions
Method, graph->dot: Exported generic functions
Method, graph->dot: Exported generic functions
Method, graph->dot-external: Exported generic functions
Method, graph->dot-properties: Exported generic functions
Method, graph->dot-properties: Exported generic functions
Method, graph-edges: Exported generic functions
Method, graph-roots: Exported generic functions
Method, graph-vertexes: Exported generic functions
Method, has-children-p: Exported generic functions
Method, has-parent-p: Exported generic functions
Method, height-in-pixels: Exported generic functions
Method, in-cycle-p: Exported generic functions
Method, in-cycle-p: Exported generic functions
Method, in-undirected-cycle-p: Exported generic functions
Method, initialize-vertex-data: Internal generic functions
Method, iterate-edges: Exported generic functions
Method, iterate-edges: Exported generic functions
Method, iterate-neighbors: Exported generic functions
Method, iterate-parents: Exported generic functions
Method, iterate-source-edges: Exported generic functions
Method, iterate-target-edges: Exported generic functions
Method, iterate-vertexes: Exported generic functions
Method, iterate-vertexes: Exported generic functions
Method, largest-edge-id: Internal generic functions
Method, largest-vertex-id: Internal generic functions
Method, make-edge-container: Internal generic functions
Method, make-edge-container: Internal generic functions
Method, make-edge-for-graph: Internal generic functions
Method, make-graph: Exported generic functions
Method, make-vertex-container: Internal generic functions
Method, make-vertex-container: Internal generic functions
Method, make-vertex-edges-container: Exported generic functions
Method, make-vertex-for-graph: Exported generic functions
Method, map-over-all-combinations-of-k-edges: Internal generic functions
Method, map-over-all-combinations-of-k-edges: Internal generic functions
Method, map-over-all-combinations-of-k-vertexes: Internal generic functions
Method, minimum-spanning-tree: Exported generic functions
Method, mst-find-set: Internal generic functions
Method, mst-link: Internal generic functions
Method, mst-make-set: Internal generic functions
Method, mst-tree-union: Internal generic functions
Method, neighbor-vertexes: Exported generic functions
Method, next-node: Exported generic functions
Method, number-of-neighbors: Exported generic functions
Method, other-vertex: Exported generic functions
Method, other-vertex: Exported generic functions
Method, out-edge-for-vertex-p: Exported generic functions
Method, parent-vertexes: Exported generic functions
Method, previous-node: Exported generic functions
Method, project-bipartite-graph: Exported generic functions
Method, project-bipartite-graph: Exported generic functions
Method, rank: Exported generic functions
Method, renumber-edges: Exported generic functions
Method, renumber-vertexes: Exported generic functions
Method, replace-vertex: Exported generic functions
Method, replace-vertex: Exported generic functions
Method, replace-vertex: Exported generic functions
Method, rooted-dfs: Exported generic functions
Method, rooted-dfs: Exported generic functions
Method, rootp: Exported generic functions
Method, search-for-vertex: Exported generic functions
Method, search-for-vertex: Exported generic functions
Method, source-edge-count: Exported generic functions
Method, source-edges: Exported generic functions
Method, source-vertex: Exported generic functions
Method, tag-all-edges: Exported generic functions
Method, tag-all-edges: Exported generic functions
Method, tag-edges: Internal generic functions
Method, tagged-edge-p: Exported generic functions
Method, target-edge-count: Exported generic functions
Method, target-edges: Exported generic functions
Method, target-vertex: Exported generic functions
Method, topological-sort: Exported generic functions
Method, traverse-elements: Internal generic functions
Method, traverse-elements-helper: Internal generic functions
Method, traverse-elements-helper: Internal generic functions
Method, undirected-edge-class: Exported generic functions
Method, undirected-edge-p: Exported generic functions
Method, untag-all-edges: Exported generic functions
Method, untag-all-edges: Exported generic functions
Method, untag-edges: Internal generic functions
Method, untagged-edge-p: Exported generic functions
Method, value: Internal generic functions
Method, value: Internal generic functions
Method, vertex: Exported generic functions
Method, vertex: Exported generic functions
Method, vertex-1: Exported generic functions
Method, vertex-1: Exported generic functions
Method, vertex-2: Exported generic functions
Method, vertex-2: Exported generic functions
Method, vertex->dot: Exported generic functions
Method, vertex->dot: Exported generic functions
Method, vertex-class: Exported generic functions
Method, vertex-count: Exported generic functions
Method, vertex-edges: Internal generic functions
Method, vertex-id: Exported generic functions
Method, vertex-key: Internal generic functions
Method, vertex-pair->edge: Internal generic functions
Method, vertex-test: Internal generic functions
Method, vertexes: Exported generic functions
Method, vertexes: Exported generic functions
Method, vertices-share-edge-p: Exported generic functions
Method, width-in-pixels: Exported generic functions
Method, write-name-for-dot: Internal generic functions
Method, write-name-for-dot: Internal generic functions
minimum-spanning-tree: Exported generic functions
minimum-spanning-tree: Exported generic functions
mst-find-set: Internal generic functions
mst-find-set: Internal generic functions
mst-link: Internal generic functions
mst-link: Internal generic functions
mst-make-set: Internal generic functions
mst-make-set: Internal generic functions
mst-tree-union: Internal generic functions
mst-tree-union: Internal generic functions

N
neighbor-vertexes: Exported generic functions
neighbor-vertexes: Exported generic functions
neighbors-to-children: Internal functions
next-node: Exported generic functions
next-node: Exported generic functions
node-color: Internal functions
node-depth: Internal functions
node-parent: Internal functions
number-of-neighbors: Exported generic functions
number-of-neighbors: Exported generic functions

O
other-vertex: Exported generic functions
other-vertex: Exported generic functions
other-vertex: Exported generic functions
out-edge-for-vertex-p: Exported generic functions
out-edge-for-vertex-p: Exported generic functions

P
parent-vertexes: Exported generic functions
parent-vertexes: Exported generic functions
previous-node: Exported generic functions
previous-node: Exported generic functions
print-dot-key-value: Exported functions
project-bipartite-graph: Exported generic functions
project-bipartite-graph: Exported generic functions
project-bipartite-graph: Exported generic functions

R
rank: Exported generic functions
rank: Exported generic functions
remove-list: Internal functions
renumber-edges: Exported generic functions
renumber-edges: Exported generic functions
renumber-vertexes: Exported generic functions
renumber-vertexes: Exported generic functions
replace-vertex: Exported generic functions
replace-vertex: Exported generic functions
replace-vertex: Exported generic functions
replace-vertex: Exported generic functions
rooted-dfs: Exported generic functions
rooted-dfs: Exported generic functions
rooted-dfs: Exported generic functions
rootp: Exported generic functions
rootp: Exported generic functions

S
search-for-vertex: Exported generic functions
search-for-vertex: Exported generic functions
search-for-vertex: Exported generic functions
source-edge-count: Exported generic functions
source-edge-count: Exported generic functions
source-edges: Exported generic functions
source-edges: Exported generic functions
source-vertex: Exported generic functions
source-vertex: Exported generic functions
subgraph-containing: Exported generic functions

T
tag-all-edges: Exported generic functions
tag-all-edges: Exported generic functions
tag-all-edges: Exported generic functions
tag-edges: Internal generic functions
tag-edges: Internal generic functions
tagged-edge-p: Exported generic functions
tagged-edge-p: Exported generic functions
target-edge-count: Exported generic functions
target-edge-count: Exported generic functions
target-edges: Exported generic functions
target-edges: Exported generic functions
target-vertex: Exported generic functions
target-vertex: Exported generic functions
textify: Internal functions
topological-sort: Exported generic functions
topological-sort: Exported generic functions
traverse-elements: Internal generic functions
traverse-elements: Internal generic functions
traverse-elements-helper: Internal generic functions
traverse-elements-helper: Internal generic functions
traverse-elements-helper: Internal generic functions

U
undirected-edge-class: Exported generic functions
undirected-edge-class: Exported generic functions
undirected-edge-p: Exported generic functions
undirected-edge-p: Exported generic functions
untag-all-edges: Exported generic functions
untag-all-edges: Exported generic functions
untag-all-edges: Exported generic functions
untag-edges: Internal generic functions
untag-edges: Internal generic functions
untagged-edge-p: Exported generic functions
untagged-edge-p: Exported generic functions

V
value: Internal generic functions
value: Internal generic functions
value: Internal generic functions
vertex: Exported generic functions
vertex: Exported generic functions
vertex: Exported generic functions
vertex-1: Exported generic functions
vertex-1: Exported generic functions
vertex-1: Exported generic functions
vertex-2: Exported generic functions
vertex-2: Exported generic functions
vertex-2: Exported generic functions
vertex->dot: Exported generic functions
vertex->dot: Exported generic functions
vertex->dot: Exported generic functions
vertex-class: Exported generic functions
vertex-class: Exported generic functions
vertex-count: Exported compiler macros
vertex-count: Exported generic functions
vertex-count: Exported generic functions
vertex-edges: Internal generic functions
vertex-edges: Internal generic functions
vertex-id: Exported generic functions
vertex-id: Exported generic functions
vertex-key: Internal generic functions
vertex-key: Internal generic functions
vertex-pair->edge: Internal generic functions
vertex-pair->edge: Internal generic functions
vertex-test: Internal generic functions
vertex-test: Internal generic functions
vertexes: Exported generic functions
vertexes: Exported generic functions
vertexes: Exported generic functions
vertices-share-edge-p: Exported generic functions
vertices-share-edge-p: Exported generic functions

W
width-in-pixels: Exported generic functions
width-in-pixels: Exported generic functions
with-changing-vertex: Exported macros
write-name-for-dot: Internal generic functions
write-name-for-dot: Internal generic functions
write-name-for-dot: Internal generic functions

Jump to:   (  
A   B   C   D   E   F   G   H   I   L   M   N   O   P   R   S   T   U   V   W  

Next: , Previous: , Up: Indexes   [Contents][Index]

A.3 Variables

Jump to:   *  
A   C   D   E   F   G   L   N   P   R   S   T   U   V   W  
Index Entry  Section

*
*depth-first-search-timer*: Internal special variables
*dot-edge-attributes*: Internal special variables
*dot-graph-attributes*: Exported special variables
*dot-path*: Internal special variables
*dot-vertex-attributes*: Internal special variables

A
adjencency-matrix: Exported classes

C
color: Exported classes
color: Exported classes
contains-directed-edge-p: Exported classes
contains-undirected-edge-p: Exported classes

D
default-edge-class: Exported classes
default-edge-type: Exported classes
depth-level: Exported classes
directed-edge-class: Exported classes
discovery-time: Exported classes
dot-attributes: Exported classes

E
edge: Exported conditions
edge-id: Exported classes
edge-key: Exported classes
edge-test: Exported classes
element: Exported classes
element: Exported classes

F
finish-time: Exported classes

G
graph: Exported conditions
graph: Exported classes
graph: Exported classes
graph-edges: Exported classes
graph-vertexes: Exported classes

L
largest-edge-id: Exported classes
largest-vertex-id: Exported classes

N
next-node: Exported classes

P
previous-node: Exported classes

R
rank: Exported classes

S
Slot, adjencency-matrix: Exported classes
Slot, color: Exported classes
Slot, color: Exported classes
Slot, contains-directed-edge-p: Exported classes
Slot, contains-undirected-edge-p: Exported classes
Slot, default-edge-class: Exported classes
Slot, default-edge-type: Exported classes
Slot, depth-level: Exported classes
Slot, directed-edge-class: Exported classes
Slot, discovery-time: Exported classes
Slot, dot-attributes: Exported classes
Slot, edge: Exported conditions
Slot, edge-id: Exported classes
Slot, edge-key: Exported classes
Slot, edge-test: Exported classes
Slot, element: Exported classes
Slot, element: Exported classes
Slot, finish-time: Exported classes
Slot, graph: Exported conditions
Slot, graph: Exported classes
Slot, graph: Exported classes
Slot, graph-edges: Exported classes
Slot, graph-vertexes: Exported classes
Slot, largest-edge-id: Exported classes
Slot, largest-vertex-id: Exported classes
Slot, next-node: Exported classes
Slot, previous-node: Exported classes
Slot, rank: Exported classes
Slot, tag: Exported classes
Slot, tag: Exported classes
Slot, undirected-edge-class: Exported classes
Slot, vertex: Exported conditions
Slot, vertex: Exported conditions
Slot, vertex-1: Exported conditions
Slot, vertex-1: Exported classes
Slot, vertex-2: Exported conditions
Slot, vertex-2: Exported classes
Slot, vertex-class: Exported classes
Slot, vertex-edges: Exported classes
Slot, vertex-id: Exported classes
Slot, vertex-key: Exported classes
Slot, vertex-pair->edge: Exported classes
Slot, vertex-test: Exported classes
Slot, weight: Exported classes
Special Variable, *depth-first-search-timer*: Internal special variables
Special Variable, *dot-edge-attributes*: Internal special variables
Special Variable, *dot-graph-attributes*: Exported special variables
Special Variable, *dot-path*: Internal special variables
Special Variable, *dot-vertex-attributes*: Internal special variables

T
tag: Exported classes
tag: Exported classes

U
undirected-edge-class: Exported classes

V
vertex: Exported conditions
vertex: Exported conditions
vertex-1: Exported conditions
vertex-1: Exported classes
vertex-2: Exported conditions
vertex-2: Exported classes
vertex-class: Exported classes
vertex-edges: Exported classes
vertex-id: Exported classes
vertex-key: Exported classes
vertex-pair->edge: Exported classes
vertex-test: Exported classes

W
weight: Exported classes

Jump to:   *  
A   C   D   E   F   G   L   N   P   R   S   T   U   V   W  

Previous: , Up: Indexes   [Contents][Index]

A.4 Data types

Jump to:   B   C   D   E   G   P   S   U   W  
Index Entry  Section

B
basic-edge: Exported classes
basic-graph: Exported classes
basic-vertex: Exported classes

C
cl-graph: The cl-graph system
cl-graph: The cl-graph package
Class, basic-edge: Exported classes
Class, basic-graph: Exported classes
Class, basic-vertex: Exported classes
Class, directed-edge-mixin: Exported classes
Class, dot-attributes-mixin: Exported classes
Class, dot-directed-edge: Exported classes
Class, dot-edge: Exported classes
Class, dot-edge-mixin: Exported classes
Class, dot-graph: Exported classes
Class, dot-graph-mixin: Exported classes
Class, dot-vertex: Exported classes
Class, dot-vertex-mixin: Exported classes
Class, graph-container: Exported classes
Class, graph-container-directed-edge: Exported classes
Class, graph-container-edge: Exported classes
Class, graph-container-undirected-edge: Exported classes
Class, graph-container-vertex: Exported classes
Class, graph-matrix: Exported classes
Class, graph-matrix-edge: Exported classes
Class, graph-matrix-vertex: Exported classes
Class, undirected-edge-mixin: Exported classes
Class, weighted-directed-edge: Exported classes
Class, weighted-edge: Exported classes
Class, weighted-edge-mixin: Exported classes
Class, weighted-undirected-edge: Exported classes
Condition, edge-error: Exported conditions
Condition, graph-edge-not-found-error: Exported conditions
Condition, graph-error: Exported conditions
Condition, graph-vertex-not-found-error: Exported conditions
Condition, graph-vertex-not-found-in-edge-error: Exported conditions

D
directed-edge-mixin: Exported classes
dot-attributes-mixin: Exported classes
dot-directed-edge: Exported classes
dot-edge: Exported classes
dot-edge-mixin: Exported classes
dot-graph: Exported classes
dot-graph-mixin: Exported classes
dot-vertex: Exported classes
dot-vertex-mixin: Exported classes

E
edge-error: Exported conditions

G
graph-container: Exported classes
graph-container-directed-edge: Exported classes
graph-container-edge: Exported classes
graph-container-undirected-edge: Exported classes
graph-container-vertex: Exported classes
graph-edge-not-found-error: Exported conditions
graph-error: Exported conditions
graph-matrix: Exported classes
graph-matrix-edge: Exported classes
graph-matrix-vertex: Exported classes
graph-vertex-not-found-error: Exported conditions
graph-vertex-not-found-in-edge-error: Exported conditions

P
Package, cl-graph: The cl-graph package

S
System, cl-graph: The cl-graph system

U
undirected-edge-mixin: Exported classes

W
weighted-directed-edge: Exported classes
weighted-edge: Exported classes
weighted-edge-mixin: Exported classes
weighted-undirected-edge: Exported classes

Jump to:   B   C   D   E   G   P   S   U   W