The cl-digraph Reference Manual

Table of Contents

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

The cl-digraph Reference Manual

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


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

1 Introduction

cl-digraph is an implementation of a mutable directed graph data structure for Common Lisp.

cl-digraph focuses on simplicity, correctness, and usability. Performance is not terrible, but is not a high priority.

It is currently not thread-safe, but this may happen in the future.

The test suite currently passes in SBCL, CCL, ECL, and ABCL on OS X and Debian. Further testing is welcome.


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

2 Systems

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


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

2.1 cl-digraph

Author

Steve Losh <steve@stevelosh.com>

Home Page

https://sjl.bitbucket.io/cl-digraph/

License

MIT/X11

Description

Simple directed graphs for Common Lisp.

Version

1.2.0

Source

cl-digraph.asd (file)

Components

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

3 Modules

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


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

3.1 cl-digraph/vendor

Parent

cl-digraph (system)

Location

vendor/

Components

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

3.2 cl-digraph/src

Dependency

package.lisp (file)

Parent

cl-digraph (system)

Location

src/

Component

directed-graph.lisp (file)


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

4 Files

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


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

4.1 Lisp


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

4.1.1 cl-digraph.asd

Location

cl-digraph.asd

Systems

cl-digraph (system)


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

4.1.2 cl-digraph/vendor/quickutils-package.lisp

Parent

vendor (module)

Location

vendor/quickutils-package.lisp

Packages

digraph.quickutils

Internal Definitions

*utilities* (special variable)


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

4.1.3 cl-digraph/vendor/quickutils.lisp

Dependency

quickutils-package.lisp (file)

Parent

vendor (module)

Location

vendor/quickutils.lisp

Exported Definitions
Internal Definitions

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

4.1.4 cl-digraph/package.lisp

Dependency

vendor (module)

Parent

cl-digraph (system)

Location

package.lisp

Packages

digraph


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

4.1.5 cl-digraph/src/directed-graph.lisp

Parent

src (module)

Location

src/directed-graph.lisp

Exported Definitions
Internal Definitions

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

5 Packages

Packages are listed by definition order.


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

5.1 digraph.quickutils

Package that contains Quickutil utility functions.

Source

quickutils-package.lisp (file)

Use List

common-lisp

Used By List

digraph

Exported Definitions
Internal Definitions

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

5.2 digraph

Source

package.lisp (file)

Use List
Exported Definitions
Internal Definitions

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

6 Definitions

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


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

6.1 Exported definitions


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

6.1.1 Macros

Macro: appendf PLACE &rest LISTS

Modify-macro for ‘append‘. Appends ‘lists‘ to the place designated by the first argument.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Macro: dohash (KEY VALUE TABLE &optional RESULT) &body BODY

Iterate over the hash table ‘table‘, executing ‘body‘, with ‘key‘ and ‘value‘ bound to the keys and values of the hash table respectively. Return ‘result‘ from the iteration form.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Macro: ensure-gethash KEY HASH-TABLE &optional DEFAULT

Like ‘gethash‘, but if ‘key‘ is not found in the ‘hash-table‘ saves the ‘default‘ under key before returning it. Secondary return value is true if key was already in the table.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Macro: once-only SPECS &body FORMS

Evaluates ‘forms‘ with symbols specified in ‘specs‘ rebound to temporary variables, ensuring that each initform is evaluated only once.

Each of ‘specs‘ must either be a symbol naming the variable to be rebound, or of the form:

(symbol initform)

Bare symbols in ‘specs‘ are equivalent to

(symbol symbol)

Example:

(defmacro cons1 (x) (once-only (x) ‘(cons ,x ,x)))
(let ((y 0)) (cons1 (incf y))) => (1 . 1)

Package

digraph.quickutils

Source

quickutils.lisp (file)

Macro: removef PLACE ITEM &rest REMOVE-KEYWORDS

Modify-macro for ‘remove‘. Sets place designated by the first argument to the result of calling ‘remove‘ with ‘item‘, place, and the ‘keyword-arguments‘.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Macro: with-gensyms NAMES &body FORMS

Binds each variable named by a symbol in ‘names‘ to a unique symbol around ‘forms‘. Each of ‘names‘ must either be either a symbol, or of the form:

(symbol string-designator)

Bare symbols appearing in ‘names‘ are equivalent to:

(symbol symbol)

The string-designator is used as the argument to ‘gensym‘ when constructing the unique symbol the named variable will be bound to.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Macro: with-unique-names NAMES &body FORMS

Binds each variable named by a symbol in ‘names‘ to a unique symbol around ‘forms‘. Each of ‘names‘ must either be either a symbol, or of the form:

(symbol string-designator)

Bare symbols appearing in ‘names‘ are equivalent to:

(symbol symbol)

The string-designator is used as the argument to ‘gensym‘ when constructing the unique symbol the named variable will be bound to.

Package

digraph.quickutils

Source

quickutils.lisp (file)


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

6.1.2 Compiler macros

Compiler Macro: compose FUNCTION &rest MORE-FUNCTIONS
Package

digraph.quickutils

Source

quickutils.lisp (file)

Compiler Macro: curry FUNCTION &rest ARGUMENTS
Package

digraph.quickutils

Source

quickutils.lisp (file)


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

6.1.3 Functions

Function: compose FUNCTION &rest MORE-FUNCTIONS

Returns a function composed of ‘function‘ and ‘more-functions‘ that applies its ; arguments to to each in turn, starting from the rightmost of ‘more-functions‘, and then calling the next one with the primary value of the last.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: contains-edge-p DIGRAPH PREDECESSOR SUCCESSOR

Return whether the graph contains an edge from ‘predecessor‘ to ‘successor‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: contains-vertex-p DIGRAPH VERTEX

Return whether the graph contains ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: copy-digraph DIGRAPH

Create a fresh copy of ‘digraph‘.

The vertex objects themselves are not copied, but everything else is.

Package

digraph

Source

directed-graph.lisp (file)

Function: count-edges DIGRAPH

Return the number of edges in ‘digraph‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: count-vertices DIGRAPH

Return the number of vertices in ‘digraph‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: curry FUNCTION &rest ARGUMENTS

Returns a function that applies ‘arguments‘ and the arguments it is called with to ‘function‘.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: degree DIGRAPH VERTEX

Return the number of neighbors of ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: degree-in DIGRAPH VERTEX

Return the number of predecessors of ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: degree-out DIGRAPH VERTEX

Return the number of successors of ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: edges DIGRAPH

Return a fresh list of the edges of ‘digraph‘.

Each edge will be a cons of the form ‘(predecessor . successor)‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: emptyp DIGRAPH

Return ‘t‘ if ‘digraph‘ has no vertices or edges, ‘nil‘ otherwise.

Package

digraph

Source

directed-graph.lisp (file)

Function: ensure-boolean X

Convert ‘x‘ into a Boolean value.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: ensure-list LIST

If ‘list‘ is a list, it is returned. Otherwise returns the list designated by ‘list‘.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: hash-table-keys TABLE

Returns a list containing the keys of hash table ‘table‘.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: insert-edge DIGRAPH PREDECESSOR SUCCESSOR

Insert an edge from ‘predecessor‘ to ‘successor‘ if not already present.

The ‘predecessor‘ and ‘successor‘ vertices must exist in the graph already.

Returns ‘t‘ if the edge was already in the graph, or ‘nil‘ if it was inserted.

Package

digraph

Source

directed-graph.lisp (file)

Function: insert-vertex DIGRAPH VERTEX

Insert ‘vertex‘ into the graph if it is not already a member.

Returns ‘t‘ if the vertex was already in the graph, or ‘nil‘ if it was inserted.

Package

digraph

Source

directed-graph.lisp (file)

Function: leafp DIGRAPH VERTEX

Return whether ‘vertex‘ is a leaf vertex in ‘digraph‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: leafs DIGRAPH

Return all leaf vertices in ‘digraph‘.

This is currently O(vertices).

A root is a vertex with no outgoing edges (i.e. out-degree 0).

Package

digraph

Source

directed-graph.lisp (file)

Function: make-digraph &key INITIAL-VERTICES TEST HASH-FUNCTION

Create and return a new digraph.

‘initial-vertices‘ can be a sequence of vertices to add to the graph.

‘test‘ should be one of the hash table equality predicates.

If your Lisp implementation supports the ‘:hash-function‘ argument for creating hash tables with custom predicates, you can specify one with ‘hash-function‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: map-breadth-first FUNCTION DIGRAPH START-VERTEX

Apply ‘function‘ to the vertices of a breadth-first traversal of ‘digraph‘.

Returns a fresh list with the results.

Vertices are processed in breadth-first order, beginning at ‘start-vertex‘, and the resulting list has this order as well.

Cycles in the graph will not be traversed into.

Package

digraph

Source

directed-graph.lisp (file)

Function: map-depth-first FUNCTION DIGRAPH START-VERTEX

Apply ‘function‘ to the vertices of a breadth-first traversal of ‘digraph‘.

Returns a fresh list with the results.

Vertices are processed in depth-first order, beginning at ‘start-vertex‘, and the resulting list has this order as well.

Cycles in the graph will not be traversed into.

Package

digraph

Source

directed-graph.lisp (file)

Function: map-edges FUNCTION DIGRAPH

Return a fresh list with the results of calling ‘function‘ on each edge.

For each edge, ‘function‘ will be called once with two arguments:

(function predecessor successor)

The order of the resulting list is unspecified.

Package

digraph

Source

directed-graph.lisp (file)

Function: map-vertices FUNCTION DIGRAPH

Return a fresh list with the results of calling ‘function‘ on each vertex.

The order of the resulting list is unspecified.

Package

digraph

Source

directed-graph.lisp (file)

Function: mapc-breadth-first FUNCTION DIGRAPH START-VERTEX

Apply ‘function‘ to the vertices of a breadth-first traversal of ‘digraph‘.

Returns ‘nil‘.

Vertices are processed in breadth-first order, beginning at ‘start-vertex‘.

Cycles in the graph will not be traversed into.

Package

digraph

Source

directed-graph.lisp (file)

Function: mapc-depth-first FUNCTION DIGRAPH START-VERTEX

Apply ‘function‘ to the vertices of a depth-first traversal of ‘digraph‘.

Returns ‘nil‘.

Vertices are processed in depth-first order, beginning at ‘start-vertex‘.

Cycles in the graph will not be traversed into.

Package

digraph

Source

directed-graph.lisp (file)

Function: mapc-edges FUNCTION DIGRAPH

Call ‘function‘ on each edge in ‘digraph‘.

For each edge, ‘function‘ will be called once with two arguments:

(function predecessor successor)

The order in which the edges are processed is unspecified.

Returns ‘nil‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: mapc-vertices FUNCTION DIGRAPH

Call ‘function‘ on each vertex in ‘digraph‘.

The order in which the vertices are processed is unspecified.

Returns ‘nil‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: maphash-keys FUNCTION TABLE

Like ‘maphash‘, but calls ‘function‘ with each key in the hash table ‘table‘.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: mkstr &rest ARGS

Receives any number of objects (string, symbol, keyword, char, number), extracts all printed representations, and concatenates them all into one string.

Extracted from _On Lisp_, chapter 4.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: neighbors DIGRAPH VERTEX

Return a fresh list of the neighbors of ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: predecessors DIGRAPH VERTEX

Return a fresh list of the predecessors of ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: rcurry FUNCTION &rest ARGUMENTS

Returns a function that applies the arguments it is called with and ‘arguments‘ to ‘function‘.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: reachablep DIGRAPH START TARGET &key STRATEGY

Return ‘t‘ if it is possible to reach ‘target‘ from ‘start‘, otherwise ‘nil‘.

All vertices are reachable from themselves.

Otherwise a ‘target‘ is reachable from ‘start‘ if a directed path exists from the start to the target.

‘strategy‘ will be used to determine how to traverse the graph when searching for a path, and can be one of ‘:breadth-first‘ or ‘:depth-first‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: remove-edge DIGRAPH PREDECESSOR SUCCESSOR

Remove an edge from ‘predecessor‘ to ‘successor‘ if present.

Returns ‘t‘ if there was such an edge, or ‘nil‘ if not.

Package

digraph

Source

directed-graph.lisp (file)

Function: remove-vertex DIGRAPH VERTEX

Remove ‘vertex‘ from the graph if present.

If there are any edges to/from ‘vertex‘ they will be automatically removed.

Returns ‘t‘ if there was such a vertex, or ‘nil‘ if not.

Package

digraph

Source

directed-graph.lisp (file)

Function: rootp DIGRAPH VERTEX

Return whether ‘vertex‘ is a root vertex in ‘digraph‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: roots DIGRAPH

Return all root vertices in ‘digraph‘.

This is currently O(vertices).

A root is a vertex with no incoming edges (i.e. in-degree 0).

Package

digraph

Source

directed-graph.lisp (file)

Function: successors DIGRAPH VERTEX

Return a fresh list of the successors of ‘vertex‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: symb &rest ARGS

Receives any number of objects, concatenates all into one string with ‘#’mkstr‘ and converts them to symbol.

Extracted from _On Lisp_, chapter 4.

See also: ‘symbolicate‘

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: topological-sort DIGRAPH

Return a fresh list of the vertices of ‘digraph‘ in topological order.

Edges are treated as meaning "depends on", so an edge ‘A –> B‘ means "A depends on B" and that B must come before A in the resulting list. Aside from this restriction, the order of the resulting list is arbitrary.

The order in which the vertices are processed is unspecified.

An error will be signaled if the graph contains a cycle.

Package

digraph

Source

directed-graph.lisp (file)

Function: vertices DIGRAPH

Return a fresh list of the vertices of ‘digraph‘.

Package

digraph

Source

directed-graph.lisp (file)


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

6.1.4 Classes

Class: digraph ()

A directed graph. Use ‘make-digraph‘ to create one.

Package

digraph

Source

directed-graph.lisp (file)

Direct superclasses

standard-object (class)

Direct methods
Direct slots
Slot: nodes
Initargs

:nodes

Readers

digraph-nodes (generic function)

Slot: test
Initargs

:test

Readers

digraph-test (generic function)

Slot: hash-function
Initargs

:hash-function

Readers

digraph-hash-function (generic function)


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

6.2 Internal definitions


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

6.2.1 Special variables

Special Variable: *utilities*
Package

digraph.quickutils

Source

quickutils-package.lisp (file)


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

6.2.2 Macros

Macro: do-edges (PREDECESSOR-SYMBOL SUCCESSOR-SYMBOL DIGRAPH) &body BODY
Package

digraph

Source

directed-graph.lisp (file)

Macro: do-vertices (SYMBOL DIGRAPH) &body BODY
Package

digraph

Source

directed-graph.lisp (file)

Macro: pred DIGRAPH OBJECT
Package

digraph

Source

directed-graph.lisp (file)

Macro: succ DIGRAPH OBJECT
Package

digraph

Source

directed-graph.lisp (file)


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

6.2.3 Functions

Function: ensure-function FUNCTION-DESIGNATOR

Returns the function designated by ‘function-designator‘:
if ‘function-designator‘ is a function, it is returned, otherwise it must be a function name and its ‘fdefinition‘ is returned.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: insert-chain DIGRAPH PREDECESSOR SUCCESSOR &rest LATER-SUCCESSORS

Insert edges between a series of vertices.

Give a series of vertices ‘V0 V1 ... Vn‘, edges between each will be inserted if not already present:

V0 -> V1 -> ... -> Vn

All vertices must exist in the graph already.

Returns ‘nil‘.

Package

digraph

Source

directed-graph.lisp (file)

Function: make-gensym-list LENGTH &optional X

Returns a list of ‘length‘ gensyms, each generated as if with a call to ‘make-gensym‘, using the second (optional, defaulting to ‘"G"‘) argument.

Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: make-hash-table-portably &key SIZE TEST HASH-FUNCTION
Package

digraph

Source

directed-graph.lisp (file)

Function: make-test-digraph ()
Package

digraph

Source

directed-graph.lisp (file)

Function: remove/swapped-arguments SEQUENCE ITEM &rest KEYWORD-ARGUMENTS
Package

digraph.quickutils

Source

quickutils.lisp (file)

Function: topological-sort% FUNCTION DIGRAPH
Package

digraph

Source

directed-graph.lisp (file)


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

6.2.4 Generic functions

Generic Function: digraph-hash-function OBJECT
Package

digraph

Methods
Method: digraph-hash-function (DIGRAPH digraph)

automatically generated reader method

Source

directed-graph.lisp (file)

Generic Function: digraph-nodes OBJECT
Package

digraph

Methods
Method: digraph-nodes (DIGRAPH digraph)

automatically generated reader method

Source

directed-graph.lisp (file)

Generic Function: digraph-test OBJECT
Package

digraph

Methods
Method: digraph-test (DIGRAPH digraph)

automatically generated reader method

Source

directed-graph.lisp (file)


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

6.2.5 Types

Type: string-designator ()

A string designator type. A string designator is either a string, a symbol, or a character.

Package

digraph.quickutils

Source

quickutils.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  
Index Entry  Section

C
cl-digraph.asd: The cl-digraph<dot>asd file
cl-digraph/package.lisp: The cl-digraph/package<dot>lisp file
cl-digraph/src: The cl-digraph/src module
cl-digraph/src/directed-graph.lisp: The cl-digraph/src/directed-graph<dot>lisp file
cl-digraph/vendor: The cl-digraph/vendor module
cl-digraph/vendor/quickutils-package.lisp: The cl-digraph/vendor/quickutils-package<dot>lisp file
cl-digraph/vendor/quickutils.lisp: The cl-digraph/vendor/quickutils<dot>lisp file

F
File, Lisp, cl-digraph.asd: The cl-digraph<dot>asd file
File, Lisp, cl-digraph/package.lisp: The cl-digraph/package<dot>lisp file
File, Lisp, cl-digraph/src/directed-graph.lisp: The cl-digraph/src/directed-graph<dot>lisp file
File, Lisp, cl-digraph/vendor/quickutils-package.lisp: The cl-digraph/vendor/quickutils-package<dot>lisp file
File, Lisp, cl-digraph/vendor/quickutils.lisp: The cl-digraph/vendor/quickutils<dot>lisp file

L
Lisp File, cl-digraph.asd: The cl-digraph<dot>asd file
Lisp File, cl-digraph/package.lisp: The cl-digraph/package<dot>lisp file
Lisp File, cl-digraph/src/directed-graph.lisp: The cl-digraph/src/directed-graph<dot>lisp file
Lisp File, cl-digraph/vendor/quickutils-package.lisp: The cl-digraph/vendor/quickutils-package<dot>lisp file
Lisp File, cl-digraph/vendor/quickutils.lisp: The cl-digraph/vendor/quickutils<dot>lisp file

M
Module, cl-digraph/src: The cl-digraph/src module
Module, cl-digraph/vendor: The cl-digraph/vendor module

Jump to:   C   F   L   M  

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

A.2 Functions

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

A
appendf: Exported macros

C
Compiler Macro, compose: Exported compiler macros
Compiler Macro, curry: Exported compiler macros
compose: Exported compiler macros
compose: Exported functions
contains-edge-p: Exported functions
contains-vertex-p: Exported functions
copy-digraph: Exported functions
count-edges: Exported functions
count-vertices: Exported functions
curry: Exported compiler macros
curry: Exported functions

D
degree: Exported functions
degree-in: Exported functions
degree-out: Exported functions
digraph-hash-function: Internal generic functions
digraph-hash-function: Internal generic functions
digraph-nodes: Internal generic functions
digraph-nodes: Internal generic functions
digraph-test: Internal generic functions
digraph-test: Internal generic functions
do-edges: Internal macros
do-vertices: Internal macros
dohash: Exported macros

E
edges: Exported functions
emptyp: Exported functions
ensure-boolean: Exported functions
ensure-function: Internal functions
ensure-gethash: Exported macros
ensure-list: Exported functions

F
Function, compose: Exported functions
Function, contains-edge-p: Exported functions
Function, contains-vertex-p: Exported functions
Function, copy-digraph: Exported functions
Function, count-edges: Exported functions
Function, count-vertices: Exported functions
Function, curry: Exported functions
Function, degree: Exported functions
Function, degree-in: Exported functions
Function, degree-out: Exported functions
Function, edges: Exported functions
Function, emptyp: Exported functions
Function, ensure-boolean: Exported functions
Function, ensure-function: Internal functions
Function, ensure-list: Exported functions
Function, hash-table-keys: Exported functions
Function, insert-chain: Internal functions
Function, insert-edge: Exported functions
Function, insert-vertex: Exported functions
Function, leafp: Exported functions
Function, leafs: Exported functions
Function, make-digraph: Exported functions
Function, make-gensym-list: Internal functions
Function, make-hash-table-portably: Internal functions
Function, make-test-digraph: Internal functions
Function, map-breadth-first: Exported functions
Function, map-depth-first: Exported functions
Function, map-edges: Exported functions
Function, map-vertices: Exported functions
Function, mapc-breadth-first: Exported functions
Function, mapc-depth-first: Exported functions
Function, mapc-edges: Exported functions
Function, mapc-vertices: Exported functions
Function, maphash-keys: Exported functions
Function, mkstr: Exported functions
Function, neighbors: Exported functions
Function, predecessors: Exported functions
Function, rcurry: Exported functions
Function, reachablep: Exported functions
Function, remove-edge: Exported functions
Function, remove-vertex: Exported functions
Function, remove/swapped-arguments: Internal functions
Function, rootp: Exported functions
Function, roots: Exported functions
Function, successors: Exported functions
Function, symb: Exported functions
Function, topological-sort: Exported functions
Function, topological-sort%: Internal functions
Function, vertices: Exported functions

G
Generic Function, digraph-hash-function: Internal generic functions
Generic Function, digraph-nodes: Internal generic functions
Generic Function, digraph-test: Internal generic functions

H
hash-table-keys: Exported functions

I
insert-chain: Internal functions
insert-edge: Exported functions
insert-vertex: Exported functions

L
leafp: Exported functions
leafs: Exported functions

M
Macro, appendf: Exported macros
Macro, do-edges: Internal macros
Macro, do-vertices: Internal macros
Macro, dohash: Exported macros
Macro, ensure-gethash: Exported macros
Macro, once-only: Exported macros
Macro, pred: Internal macros
Macro, removef: Exported macros
Macro, succ: Internal macros
Macro, with-gensyms: Exported macros
Macro, with-unique-names: Exported macros
make-digraph: Exported functions
make-gensym-list: Internal functions
make-hash-table-portably: Internal functions
make-test-digraph: Internal functions
map-breadth-first: Exported functions
map-depth-first: Exported functions
map-edges: Exported functions
map-vertices: Exported functions
mapc-breadth-first: Exported functions
mapc-depth-first: Exported functions
mapc-edges: Exported functions
mapc-vertices: Exported functions
maphash-keys: Exported functions
Method, digraph-hash-function: Internal generic functions
Method, digraph-nodes: Internal generic functions
Method, digraph-test: Internal generic functions
mkstr: Exported functions

N
neighbors: Exported functions

O
once-only: Exported macros

P
pred: Internal macros
predecessors: Exported functions

R
rcurry: Exported functions
reachablep: Exported functions
remove-edge: Exported functions
remove-vertex: Exported functions
remove/swapped-arguments: Internal functions
removef: Exported macros
rootp: Exported functions
roots: Exported functions

S
succ: Internal macros
successors: Exported functions
symb: Exported functions

T
topological-sort: Exported functions
topological-sort%: Internal functions

V
vertices: Exported functions

W
with-gensyms: Exported macros
with-unique-names: Exported macros

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

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

A.3 Variables

Jump to:   *  
H   N   S   T  
Index Entry  Section

*
*utilities*: Internal special variables

H
hash-function: Exported classes

N
nodes: Exported classes

S
Slot, hash-function: Exported classes
Slot, nodes: Exported classes
Slot, test: Exported classes
Special Variable, *utilities*: Internal special variables

T
test: Exported classes

Jump to:   *  
H   N   S   T  

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

A.4 Data types

Jump to:   C   D   P   S   T  
Index Entry  Section

C
cl-digraph: The cl-digraph system
Class, digraph: Exported classes

D
digraph: The digraph package
digraph: Exported classes
digraph.quickutils: The digraph<dot>quickutils package

P
Package, digraph: The digraph package
Package, digraph.quickutils: The digraph<dot>quickutils package

S
string-designator: Internal types
System, cl-digraph: The cl-digraph system

T
Type, string-designator: Internal types

Jump to:   C   D   P   S   T