The epigraph Reference Manual

Table of Contents

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

The epigraph Reference Manual

This is the epigraph Reference Manual, version 0.0.2, generated automatically by Declt version 2.3 "Robert April" on Wed Mar 14 03:51:27 2018 GMT+0.


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

1 Introduction

epigraph, a library for manipulating graphs in common lisp. Cyrus Harmon ch-lisp@bobobeach.com

Epigraph is a common lisp package for representing graph, that is sets of nodes that may contain edges between the various nodes.

Example

(defparameter graph (let ((g (make-graph :node-test 'equal)))

(loop for i from 1 below 12
   do (add-node g (concatenate 'string "Node " (princ-to-string i))))

(add-edge-between-nodes g "Node 1" "Node 2")
(add-edge-between-nodes g "Node 1" "Node 3")
(add-edge-between-nodes g "Node 3" "Node 4")
(add-edge-between-nodes g "Node 3" "Node 5")
(add-edge-between-nodes g "Node 2" "Node 6")
(add-edge-between-nodes g "Node 6" "Node 7")
(add-edge-between-nodes g "Node 6" "Node 8")
(add-edge-between-nodes g "Node 4" "Node 9")
(add-edge-between-nodes g "Node 5" "Node 10")
(add-edge-between-nodes g "Node 5" "Node 11")
(add-edge-between-nodes g "Node 1" "Node 11")
(add-edge-between-nodes g "Node 8" "Node 7")
g))

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 epigraph

Author

Cyrus Harmon <ch-lisp@bobobeach.com>

License

BSD

Description

A library for representing and processing graphs (nodes and edges)

Version

0.0.2

Dependency

alexandria

Source

epigraph.asd (file)

Components

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 epigraph.asd

Location

epigraph.asd

Systems

epigraph (system)


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

3.1.2 epigraph/package.lisp

Dependency

readme (file)

Parent

epigraph (system)

Location

package.lisp

Packages

epigraph


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

3.1.3 epigraph/utilities.lisp

Dependency

package.lisp (file)

Parent

epigraph (system)

Location

utilities.lisp

Internal Definitions

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

3.1.4 epigraph/epigraph.lisp

Dependency

utilities.lisp (file)

Parent

epigraph (system)

Location

epigraph.lisp

Exported Definitions
Internal Definitions

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

3.1.5 epigraph/simple-edge-list-graph.lisp

Dependency

epigraph.lisp (file)

Parent

epigraph (system)

Location

simple-edge-list-graph.lisp

Exported Definitions
Internal Definitions

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

3.2 Other


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

3.2.1 epigraph/COPYRIGHT

Parent

epigraph (system)

Location

COPYRIGHT


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

3.2.2 epigraph/README

Dependency

copyright (file)

Parent

epigraph (system)

Location

/home/quickbuilder/quicklisp/dists/quicklisp/software/epigraph-20160628-git/README (not found)


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

4 Packages

Packages are listed by definition order.


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

4.1 epigraph

Source

package.lisp (file)

Nickname

graph

Use List

common-lisp

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: *default-edge-class*
Package

epigraph

Source

epigraph.lisp (file)

Special Variable: *default-graph-class*
Package

epigraph

Source

epigraph.lisp (file)


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

5.1.2 Functions

Function: break-cycles GRAPH &key START PICK-FUNCTION

Finds all of the cycles in a graph and returns four VALUEs, a list of the edges that make complete the cycles, a list of the paths that form the cycles, a list of the cycle-forming edges, and a copy of GRAPH, with the cycle-forming edges removed.

Package

epigraph

Source

epigraph.lisp (file)

Function: find-connected-components GRAPH &key START
Package

epigraph

Source

epigraph.lisp (file)

Function: find-cycle GRAPH &key START TEST

Finds a cycle in graph, if one exists, using depth-first-search and returns two VALUES, a list of the edges in the cycle, and a list of the nodes in the cycle.

Package

epigraph

Source

epigraph.lisp (file)

Function: find-cycle-edges GRAPH &key START TEST
Package

epigraph

Source

epigraph.lisp (file)

Function: find-longest-path GRAPH

Returns a single vector containing a longest path reachable from any node in graph. The vector contains the elements in path order, starting with the first node and ending in the most distant node on the path.

Package

epigraph

Source

epigraph.lisp (file)

Function: find-longest-paths GRAPH

Finds a longest path acecssible from each node in the
graph. Returns a list of vectors containing the longest paths for each node. Each vector represents the path to the farthest node from the first node of the vector to the last node of the vector.

Package

epigraph

Source

epigraph.lisp (file)

Function: graph-distance GRAPH NODE1 NODE2

Returns the (shortest) number of edges between node1 and node2. If node1 is node2, the distance is 0.

Package

epigraph

Source

epigraph.lisp (file)

Function: graph-distance-hash-table GRAPH

Returns a hash-table where each value is another hash-table, where each value is the distance from the node that is the key of the first hash-table to the node that is the key of the second hash-table.

Package

epigraph

Source

epigraph.lisp (file)

Function: graph-distance-matrix GRAPH

Returns two values, an array where each entry i,j is the distance from node i to node j (distance from a node to itself is 0) and an array of nodes in the order corresponding to a dimension of the array of distances.

Package

epigraph

Source

epigraph.lisp (file)

Function: make-graph &rest ARGS &key CLASS NODE-TEST &allow-other-keys

Creates a GRAPH instance whose actual class will either be specified by GRAPH-CLASS or by *DEFAULT-GRAPH-CLASS*.

Package

epigraph

Source

epigraph.lisp (file)

Function: node-equal GRAPH NODE1 NODE2 &key TEST
Package

epigraph

Source

epigraph.lisp (file)

Function: node-find GRAPH ITEM SEQUENCE &key FROM-END START END KEY TEST TEST-NOT
Package

epigraph

Source

epigraph.lisp (file)

Function: node-position GRAPH ITEM SEQUENCE &key FROM-END START END KEY TEST TEST-NOT
Package

epigraph

Source

epigraph.lisp (file)

Function: node-remove GRAPH ITEM SEQUENCE &key FROM-END START END KEY COUNT TEST TEST-NOT
Package

epigraph

Source

epigraph.lisp (file)

Function: remove-connected-component GRAPH &key START
Package

epigraph

Source

epigraph.lisp (file)


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

5.1.3 Generic functions

Generic Function: add-edge GRAPH EDGE

Adds an edge to the graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: add-edge (GRAPH simple-edge-list-graph) (EDGE edge)
Source

simple-edge-list-graph.lisp (file)

Generic Function: add-edge-between-nodes GRAPH NODE1 NODE2 &key EDGE-CLASS

Creates an edge from node1 to node2, adds it to the graph, and returns the edge.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: add-edge-between-nodes (GRAPH simple-edge-list-graph) NODE1 NODE2 &key EDGE-CLASS
Source

simple-edge-list-graph.lisp (file)

Generic Function: add-node GRAPH NODE

Add a node to the graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: add-node (GRAPH simple-edge-list-graph) NODE
Source

simple-edge-list-graph.lisp (file)

Generic Function: bfs GRAPH START END &key KEY TEST NEIGHBOR-FN

Performs a breadth-first-search on graph starting
at start and returns a path end if end is reachable from start, otherwise returns NIL. [DOCUMENT KEY AND TEST ARGS PLEASE!]

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: bfs (GRAPH graph) START END &key KEY TEST NEIGHBOR-FN
Generic Function: bfs-map GRAPH START FN &key END KEY TEST NEIGHBOR-FN

Performs a breadth-first-search on graph starting
at start until node end is found, if it is specified, calling fn, a function of one argument, for each node as it is found. [DOCUMENT KEY AND TEST ARGS PLEASE!]

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: bfs-map (GRAPH graph) START FN &key END KEY TEST NEIGHBOR-FN
Generic Function: bfs-map-edges GRAPH START FN &key END KEY TEST

Performs a breadth-first-search on graph, starting
at start until node end is found, if it is specified, calling fn, a function of one argument, for each edge as it is found. [DOCUMENT KEY AND TEST ARGS PLEASE!]

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: bfs-map-edges (GRAPH graph) START FN &key END KEY TEST
Generic Function: copy-edge EDGE

Returns a copy of the edge.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: copy-edge (EDGE edge)
Generic Function: copy-graph GRAPH &key COPY-EDGES

Returns a copy of the graph which will contain the
same nodes as the original graph and either the same edges as graph or copies of the edges, depending on the value of &key copy-edges.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: copy-graph (GRAPH simple-edge-list-graph) &key COPY-EDGES
Source

simple-edge-list-graph.lisp (file)

Generic Function: dfs GRAPH START END &key KEY TEST NEIGHBOR-FN

Performs a depth-first-search on graph, starting at
start and returns a path end if end is reachable from start, otherwise returns NIL. [DOCUMENT KEY AND TEST ARGS PLEASE!]

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: dfs (GRAPH graph) START END &key KEY TEST NEIGHBOR-FN
Generic Function: dfs-map GRAPH START FN &key END KEY TEST NEIGHBOR-FN

Performs a depth-first-search on graph, starting at
start until node end is found, if it is specified, calling fn, a function of one argument, for each node as it is found. [DOCUMENT KEY AND TEST ARGS PLEASE!]

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: dfs-map (GRAPH graph) START FN &key END KEY TEST NEIGHBOR-FN
Generic Function: dfs-map-edges GRAPH START FN &key END KEY TEST

Performs a depth-first-search on graph, starting at
start until node end is found, if it is specified, calling fn, a function of one argument, for each edge as it is found. [DOCUMENT KEY AND TEST ARGS PLEASE!]

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: dfs-map-edges (GRAPH graph) START FN &key END KEY TEST
Generic Function: edge-data OBJECT
Generic Function: (setf edge-data) NEW-VALUE OBJECT
Package

epigraph

Methods
Method: edge-data (EDGE edge)

automatically generated reader method

Source

epigraph.lisp (file)

Method: (setf edge-data) NEW-VALUE (EDGE edge)

automatically generated writer method

Source

epigraph.lisp (file)

Generic Function: edgep GRAPH NODE1 NODE2

Returns the edge that connects node1 and node2 in
graph if the edge is present in the graph, otherwise returns NIL.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: edgep (GRAPH simple-edge-list-graph) NODE1 NODE2
Source

simple-edge-list-graph.lisp (file)

Generic Function: edges GRAPH

Returns the edges of graph. Currently the
format in which the edges are returned is not specified.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: edges (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Generic Function: edges-nodes-equal EDGE1 EDGE2 &key TEST

Returns T if the two edges connect the same
nodes. Note that currently there is no notion of direction between edges, so edges from A to B and from B to A are equivalent and therefore edges-nodes-equal returns T for those two edges.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: edges-nodes-equal (EDGE1 edge) (EDGE2 edge) &key TEST
Generic Function: find-edges-containing GRAPH NODE &key TEST

Returns a list of the edges in graph that start or end with node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: find-edges-containing (GRAPH simple-edge-list-graph) NODE &key TEST
Source

simple-edge-list-graph.lisp (file)

Generic Function: find-edges-from GRAPH NODE &key TEST

Returns a list of the edges in graph that begin with node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: find-edges-from (GRAPH simple-edge-list-graph) NODE &key TEST
Source

simple-edge-list-graph.lisp (file)

Generic Function: find-edges-to GRAPH NODE &key TEST

Returns a list of the edges in graph that end with node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: find-edges-to (GRAPH simple-edge-list-graph) NODE &key TEST
Source

simple-edge-list-graph.lisp (file)

Generic Function: first-node GRAPH

Returns the first node in a graph. Note that not
all graphs are rquired to support this function and that even graphs that do support this might not have a consistent ordering of the nodes such that successive first-node calls might not return the same node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: first-node (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Generic Function: map-edges FN RESULT-TYPE GRAPH

Calls fn, a function of one argument, for each edge in graph in an unspecified order.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: map-edges FN RESULT-TYPE (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Generic Function: map-edges->list FN GRAPH

Calls fn, a function of one argument, for each edge
in graph in an unspecified order and accumulates the return first returned values of fn in a list.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: map-edges->list FN (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Generic Function: map-nodes FN GRAPH

Calls FN on every node in the graph, without regard to the configuration of the graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: map-nodes FN (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Generic Function: map-nodes->list FN GRAPH

Calls FN on every node in the graph, without regard
to the configuration of the graph and returns the resulting values in a list.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: map-nodes->list FN (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Generic Function: neighbors GRAPH NODE &key TEST

Returns a list of the nodes that are connected to node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: neighbors GRAPH NODE &key TEST
Generic Function: node-count GRAPH

Returns the number of nodes in graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: node-count (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

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

epigraph

Methods
Method: node1 (EDGE edge)

automatically generated reader method

Source

epigraph.lisp (file)

Method: (setf node1) NEW-VALUE (EDGE edge)

automatically generated writer method

Source

epigraph.lisp (file)

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

epigraph

Methods
Method: node2 (EDGE edge)

automatically generated reader method

Source

epigraph.lisp (file)

Method: (setf node2) NEW-VALUE (EDGE edge)

automatically generated writer method

Source

epigraph.lisp (file)

Generic Function: nodes GRAPH

Returns the nodes of graph. Currently the
format in which the nodes are returned is not specified.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: nodes (GRAPH simple-edge-list-graph)
Source

simple-edge-list-graph.lisp (file)

Method: nodes (EDGE edge)
Generic Function: other-edge-node EDGE NODE

Returns the other node in the edge. That is if
there is an edge between A and B, other-edge-node of A would return B. If the edge is a self-edge, returns node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: other-edge-node (EDGE edge) NODE
Generic Function: print-edge-data OBJECT STREAM

Prints data about a given edge. This function is
called from the print-object method specialied on EDGE objects. To add additional data to be printed by subclasses of edge create an :AFTER method on PRINT-EDGE-DATA.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: print-edge-data (OBJECT edge) STREAM
Generic Function: remove-edge GRAPH EDGE &key TEST

Removes edge from the graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: remove-edge (GRAPH simple-edge-list-graph) (EDGE edge) &key TEST
Source

simple-edge-list-graph.lisp (file)

Generic Function: remove-edge-between-nodes GRAPH NODE1 NODE2

Removes the edge from node1 to node2 in the graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: remove-edge-between-nodes (GRAPH simple-edge-list-graph) NODE1 NODE2
Source

simple-edge-list-graph.lisp (file)

Generic Function: remove-node GRAPH NODE

Remove a node from the graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: remove-node (GRAPH simple-edge-list-graph) NODE
Source

simple-edge-list-graph.lisp (file)

Generic Function: self-edge-p GRAPH EDGE &key TEST

Returns true if the edge connects a given node to itself.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: self-edge-p (GRAPH simple-edge-list-graph) EDGE &key TEST
Source

simple-edge-list-graph.lisp (file)


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

5.1.4 Classes

Class: edge ()

Instances of the EDGE class represent edges between nodes in a graph.

Package

epigraph

Source

epigraph.lisp (file)

Direct superclasses

standard-object (class)

Direct methods
Direct slots
Slot: node1
Initargs

:node1

Readers

node1 (generic function)

Writers

(setf node1) (generic function)

Slot: node2
Initargs

:node2

Readers

node2 (generic function)

Writers

(setf node2) (generic function)

Slot: data
Initargs

:data

Readers

edge-data (generic function)

Writers

(setf edge-data) (generic function)

Class: graph ()

The protocol class of graphs. The intent is that
there will be concrete subclasses of GRAPH with different implementations of storing the nodes and edges.

Package

epigraph

Source

epigraph.lisp (file)

Direct superclasses

standard-object (class)

Direct subclasses

simple-edge-list-graph (class)

Direct methods
Direct slots
Slot: node-test
Initargs

:node-test

Initform

(quote eql)

Readers

graph-node-test (generic function)

Writers

(setf graph-node-test) (generic function)

Class: simple-edge-list-graph ()

A concrete subclass of graph that represents the edges in the graph with a list of edges between nodes.

Package

epigraph

Source

simple-edge-list-graph.lisp (file)

Direct superclasses

graph (class)

Direct methods
Direct slots
Slot: node-hash
Initargs

:nodes

Initform

(make-hash-table :test (quote equal))

Readers

graph-node-hash (generic function)

Writers

(setf graph-node-hash) (generic function)

Slot: edges
Initargs

:edges

Readers

graph-edge-list (generic function)

Writers

(setf graph-edge-list) (generic function)


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

5.2 Internal definitions


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

5.2.1 Special variables

Special Variable: *bfs-depth*
Package

epigraph

Source

epigraph.lisp (file)

Special Variable: *dfs-depth*
Package

epigraph

Source

epigraph.lisp (file)


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

5.2.2 Macros

Macro: with-graph-iterator (FUNCTION GRAPH) &body BODY
Package

epigraph

Source

simple-edge-list-graph.lisp (file)


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

5.2.3 Functions

Function: carhash HASH-TABLE
Package

epigraph

Source

utilities.lisp (file)

Function: floyd-warshall GRAPH
Package

epigraph

Source

epigraph.lisp (file)

Function: make-node-hash-table GRAPH
Package

epigraph

Source

epigraph.lisp (file)

Function: makeq ()
Package

epigraph

Source

epigraph.lisp (file)

Function: remove-keyword-args KEYWORDS LIST
Package

epigraph

Source

utilities.lisp (file)


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

5.2.4 Generic functions

Generic Function: bfs2 GRAPH START END &key KEY TEST
Package

epigraph

Methods
Method: bfs2 (GRAPH graph) START END &key KEY TEST
Source

epigraph.lisp (file)

Generic Function: dfs2 GRAPH START END &key KEY TEST
Package

epigraph

Methods
Method: dfs2 (GRAPH graph) START END &key KEY TEST
Source

epigraph.lisp (file)

Generic Function: find-edge GRAPH NODE1 NODE2
Package

epigraph

Methods
Method: find-edge (GRAPH simple-edge-list-graph) NODE1 NODE2
Source

simple-edge-list-graph.lisp (file)

Generic Function: find-self-edges GRAPH NODE &key TEST

Returns a list of the edges in graph that begin and end with node.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: find-self-edges (GRAPH simple-edge-list-graph) NODE &key TEST
Source

simple-edge-list-graph.lisp (file)

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

epigraph

Methods
Method: graph-edge-list (SIMPLE-EDGE-LIST-GRAPH simple-edge-list-graph)

automatically generated reader method

Source

simple-edge-list-graph.lisp (file)

Method: (setf graph-edge-list) NEW-VALUE (SIMPLE-EDGE-LIST-GRAPH simple-edge-list-graph)

automatically generated writer method

Source

simple-edge-list-graph.lisp (file)

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

epigraph

Methods
Method: graph-node-hash (SIMPLE-EDGE-LIST-GRAPH simple-edge-list-graph)

automatically generated reader method

Source

simple-edge-list-graph.lisp (file)

Method: (setf graph-node-hash) NEW-VALUE (SIMPLE-EDGE-LIST-GRAPH simple-edge-list-graph)

automatically generated writer method

Source

simple-edge-list-graph.lisp (file)

Generic Function: graph-node-p GRAPH NODE

Returns t if node is a node in graph.

Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: graph-node-p (GRAPH simple-edge-list-graph) NODE
Source

simple-edge-list-graph.lisp (file)

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

epigraph

Methods
Method: graph-node-test (GRAPH graph)

automatically generated reader method

Source

epigraph.lisp (file)

Method: (setf graph-node-test) NEW-VALUE (GRAPH graph)

automatically generated writer method

Source

epigraph.lisp (file)

Generic Function: graph-search GRAPH START END &key KEY TEST QUEUEING-FUNCTION
Package

epigraph

Methods
Method: graph-search (GRAPH graph) START END &key KEY TEST QUEUEING-FUNCTION
Source

epigraph.lisp (file)

Generic Function: neighbors-and-edges GRAPH NODE &key TEST
Package

epigraph

Methods
Method: neighbors-and-edges GRAPH NODE &key TEST
Source

epigraph.lisp (file)

Generic Function: qappend Q ITEM
Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: qappend Q ITEM
Generic Function: qitems OBJECT
Generic Function: (setf qitems) NEW-VALUE OBJECT
Package

epigraph

Methods
Method: qitems (Q q)

automatically generated reader method

Source

epigraph.lisp (file)

Method: (setf qitems) NEW-VALUE (Q q)

automatically generated writer method

Source

epigraph.lisp (file)

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

epigraph

Methods
Method: qlast (Q q)

automatically generated reader method

Source

epigraph.lisp (file)

Method: (setf qlast) NEW-VALUE (Q q)

automatically generated writer method

Source

epigraph.lisp (file)

Generic Function: qpop Q
Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: qpop Q
Generic Function: qpush Q ITEM
Package

epigraph

Source

epigraph.lisp (file)

Methods
Method: qpush Q ITEM

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

5.2.5 Classes

Class: q ()
Package

epigraph

Source

epigraph.lisp (file)

Direct superclasses

standard-object (class)

Direct methods
  • qlast (method)
  • qlast (method)
  • qitems (method)
  • qitems (method)
Direct slots
Slot: items
Readers

qitems (generic function)

Writers

(setf qitems) (generic function)

Slot: last
Readers

qlast (generic function)

Writers

(setf qlast) (generic function)


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

Appendix A Indexes


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

A.1 Concepts

Jump to:   E   F   L   O  
Index Entry  Section

E
epigraph.asd: The epigraph<dot>asd file
epigraph/COPYRIGHT: The epigraph/copyright file
epigraph/epigraph.lisp: The epigraph/epigraph<dot>lisp file
epigraph/package.lisp: The epigraph/package<dot>lisp file
epigraph/README: The epigraph/readme file
epigraph/simple-edge-list-graph.lisp: The epigraph/simple-edge-list-graph<dot>lisp file
epigraph/utilities.lisp: The epigraph/utilities<dot>lisp file

F
File, Lisp, epigraph.asd: The epigraph<dot>asd file
File, Lisp, epigraph/epigraph.lisp: The epigraph/epigraph<dot>lisp file
File, Lisp, epigraph/package.lisp: The epigraph/package<dot>lisp file
File, Lisp, epigraph/simple-edge-list-graph.lisp: The epigraph/simple-edge-list-graph<dot>lisp file
File, Lisp, epigraph/utilities.lisp: The epigraph/utilities<dot>lisp file
File, other, epigraph/COPYRIGHT: The epigraph/copyright file
File, other, epigraph/README: The epigraph/readme file

L
Lisp File, epigraph.asd: The epigraph<dot>asd file
Lisp File, epigraph/epigraph.lisp: The epigraph/epigraph<dot>lisp file
Lisp File, epigraph/package.lisp: The epigraph/package<dot>lisp file
Lisp File, epigraph/simple-edge-list-graph.lisp: The epigraph/simple-edge-list-graph<dot>lisp file
Lisp File, epigraph/utilities.lisp: The epigraph/utilities<dot>lisp file

O
Other File, epigraph/COPYRIGHT: The epigraph/copyright file
Other File, epigraph/README: The epigraph/readme file

Jump to:   E   F   L   O  

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

A.2 Functions

Jump to:   (  
A   B   C   D   E   F   G   M   N   O   P   Q   R   S   W  
Index Entry  Section

(
(setf edge-data): Exported generic functions
(setf edge-data): Exported generic functions
(setf graph-edge-list): Internal generic functions
(setf graph-edge-list): Internal generic functions
(setf graph-node-hash): Internal generic functions
(setf graph-node-hash): Internal generic functions
(setf graph-node-test): Internal generic functions
(setf graph-node-test): Internal generic functions
(setf node1): Exported generic functions
(setf node1): Exported generic functions
(setf node2): Exported generic functions
(setf node2): Exported generic functions
(setf qitems): Internal generic functions
(setf qitems): Internal generic functions
(setf qlast): Internal generic functions
(setf qlast): Internal generic functions

A
add-edge: Exported generic functions
add-edge: Exported generic functions
add-edge-between-nodes: Exported generic functions
add-edge-between-nodes: Exported generic functions
add-node: Exported generic functions
add-node: Exported generic functions

B
bfs: Exported generic functions
bfs: Exported generic functions
bfs-map: Exported generic functions
bfs-map: Exported generic functions
bfs-map-edges: Exported generic functions
bfs-map-edges: Exported generic functions
bfs2: Internal generic functions
bfs2: Internal generic functions
break-cycles: Exported functions

C
carhash: Internal functions
copy-edge: Exported generic functions
copy-edge: Exported generic functions
copy-graph: Exported generic functions
copy-graph: Exported generic functions

D
dfs: Exported generic functions
dfs: Exported generic functions
dfs-map: Exported generic functions
dfs-map: Exported generic functions
dfs-map-edges: Exported generic functions
dfs-map-edges: Exported generic functions
dfs2: Internal generic functions
dfs2: Internal generic functions

E
edge-data: Exported generic functions
edge-data: Exported generic functions
edgep: Exported generic functions
edgep: Exported generic functions
edges: Exported generic functions
edges: Exported generic functions
edges-nodes-equal: Exported generic functions
edges-nodes-equal: Exported generic functions

F
find-connected-components: Exported functions
find-cycle: Exported functions
find-cycle-edges: Exported functions
find-edge: Internal generic functions
find-edge: Internal generic functions
find-edges-containing: Exported generic functions
find-edges-containing: Exported generic functions
find-edges-from: Exported generic functions
find-edges-from: Exported generic functions
find-edges-to: Exported generic functions
find-edges-to: Exported generic functions
find-longest-path: Exported functions
find-longest-paths: Exported functions
find-self-edges: Internal generic functions
find-self-edges: Internal generic functions
first-node: Exported generic functions
first-node: Exported generic functions
floyd-warshall: Internal functions
Function, break-cycles: Exported functions
Function, carhash: Internal functions
Function, find-connected-components: Exported functions
Function, find-cycle: Exported functions
Function, find-cycle-edges: Exported functions
Function, find-longest-path: Exported functions
Function, find-longest-paths: Exported functions
Function, floyd-warshall: Internal functions
Function, graph-distance: Exported functions
Function, graph-distance-hash-table: Exported functions
Function, graph-distance-matrix: Exported functions
Function, make-graph: Exported functions
Function, make-node-hash-table: Internal functions
Function, makeq: Internal functions
Function, node-equal: Exported functions
Function, node-find: Exported functions
Function, node-position: Exported functions
Function, node-remove: Exported functions
Function, remove-connected-component: Exported functions
Function, remove-keyword-args: Internal functions

G
Generic Function, (setf edge-data): Exported generic functions
Generic Function, (setf graph-edge-list): Internal generic functions
Generic Function, (setf graph-node-hash): Internal generic functions
Generic Function, (setf graph-node-test): Internal generic functions
Generic Function, (setf node1): Exported generic functions
Generic Function, (setf node2): Exported generic functions
Generic Function, (setf qitems): Internal generic functions
Generic Function, (setf qlast): Internal generic functions
Generic Function, add-edge: Exported generic functions
Generic Function, add-edge-between-nodes: Exported generic functions
Generic Function, add-node: Exported generic functions
Generic Function, bfs: Exported generic functions
Generic Function, bfs-map: Exported generic functions
Generic Function, bfs-map-edges: Exported generic functions
Generic Function, bfs2: Internal generic functions
Generic Function, copy-edge: Exported generic functions
Generic Function, copy-graph: Exported generic functions
Generic Function, dfs: Exported generic functions
Generic Function, dfs-map: Exported generic functions
Generic Function, dfs-map-edges: Exported generic functions
Generic Function, dfs2: Internal generic functions
Generic Function, edge-data: Exported generic functions
Generic Function, edgep: Exported generic functions
Generic Function, edges: Exported generic functions
Generic Function, edges-nodes-equal: Exported generic functions
Generic Function, find-edge: Internal generic functions
Generic Function, find-edges-containing: Exported generic functions
Generic Function, find-edges-from: Exported generic functions
Generic Function, find-edges-to: Exported generic functions
Generic Function, find-self-edges: Internal generic functions
Generic Function, first-node: Exported generic functions
Generic Function, graph-edge-list: Internal generic functions
Generic Function, graph-node-hash: Internal generic functions
Generic Function, graph-node-p: Internal generic functions
Generic Function, graph-node-test: Internal generic functions
Generic Function, graph-search: Internal generic functions
Generic Function, map-edges: Exported generic functions
Generic Function, map-edges->list: Exported generic functions
Generic Function, map-nodes: Exported generic functions
Generic Function, map-nodes->list: Exported generic functions
Generic Function, neighbors: Exported generic functions
Generic Function, neighbors-and-edges: Internal generic functions
Generic Function, node-count: Exported generic functions
Generic Function, node1: Exported generic functions
Generic Function, node2: Exported generic functions
Generic Function, nodes: Exported generic functions
Generic Function, other-edge-node: Exported generic functions
Generic Function, print-edge-data: Exported generic functions
Generic Function, qappend: Internal generic functions
Generic Function, qitems: Internal generic functions
Generic Function, qlast: Internal generic functions
Generic Function, qpop: Internal generic functions
Generic Function, qpush: Internal generic functions
Generic Function, remove-edge: Exported generic functions
Generic Function, remove-edge-between-nodes: Exported generic functions
Generic Function, remove-node: Exported generic functions
Generic Function, self-edge-p: Exported generic functions
graph-distance: Exported functions
graph-distance-hash-table: Exported functions
graph-distance-matrix: Exported functions
graph-edge-list: Internal generic functions
graph-edge-list: Internal generic functions
graph-node-hash: Internal generic functions
graph-node-hash: Internal generic functions
graph-node-p: Internal generic functions
graph-node-p: Internal generic functions
graph-node-test: Internal generic functions
graph-node-test: Internal generic functions
graph-search: Internal generic functions
graph-search: Internal generic functions

M
Macro, with-graph-iterator: Internal macros
make-graph: Exported functions
make-node-hash-table: Internal functions
makeq: Internal functions
map-edges: Exported generic functions
map-edges: Exported generic functions
map-edges->list: Exported generic functions
map-edges->list: Exported generic functions
map-nodes: Exported generic functions
map-nodes: Exported generic functions
map-nodes->list: Exported generic functions
map-nodes->list: Exported generic functions
Method, (setf edge-data): Exported generic functions
Method, (setf graph-edge-list): Internal generic functions
Method, (setf graph-node-hash): Internal generic functions
Method, (setf graph-node-test): Internal generic functions
Method, (setf node1): Exported generic functions
Method, (setf node2): Exported generic functions
Method, (setf qitems): Internal generic functions
Method, (setf qlast): Internal generic functions
Method, add-edge: Exported generic functions
Method, add-edge-between-nodes: Exported generic functions
Method, add-node: Exported generic functions
Method, bfs: Exported generic functions
Method, bfs-map: Exported generic functions
Method, bfs-map-edges: Exported generic functions
Method, bfs2: Internal generic functions
Method, copy-edge: Exported generic functions
Method, copy-graph: Exported generic functions
Method, dfs: Exported generic functions
Method, dfs-map: Exported generic functions
Method, dfs-map-edges: Exported generic functions
Method, dfs2: Internal generic functions
Method, edge-data: Exported generic functions
Method, edgep: Exported generic functions
Method, edges: Exported generic functions
Method, edges-nodes-equal: Exported generic functions
Method, find-edge: Internal generic functions
Method, find-edges-containing: Exported generic functions
Method, find-edges-from: Exported generic functions
Method, find-edges-to: Exported generic functions
Method, find-self-edges: Internal generic functions
Method, first-node: Exported generic functions
Method, graph-edge-list: Internal generic functions
Method, graph-node-hash: Internal generic functions
Method, graph-node-p: Internal generic functions
Method, graph-node-test: Internal generic functions
Method, graph-search: Internal generic functions
Method, map-edges: Exported generic functions
Method, map-edges->list: Exported generic functions
Method, map-nodes: Exported generic functions
Method, map-nodes->list: Exported generic functions
Method, neighbors: Exported generic functions
Method, neighbors-and-edges: Internal generic functions
Method, node-count: Exported generic functions
Method, node1: Exported generic functions
Method, node2: Exported generic functions
Method, nodes: Exported generic functions
Method, nodes: Exported generic functions
Method, other-edge-node: Exported generic functions
Method, print-edge-data: Exported generic functions
Method, qappend: Internal generic functions
Method, qitems: Internal generic functions
Method, qlast: Internal generic functions
Method, qpop: Internal generic functions
Method, qpush: Internal generic functions
Method, remove-edge: Exported generic functions
Method, remove-edge-between-nodes: Exported generic functions
Method, remove-node: Exported generic functions
Method, self-edge-p: Exported generic functions

N
neighbors: Exported generic functions
neighbors: Exported generic functions
neighbors-and-edges: Internal generic functions
neighbors-and-edges: Internal generic functions
node-count: Exported generic functions
node-count: Exported generic functions
node-equal: Exported functions
node-find: Exported functions
node-position: Exported functions
node-remove: Exported functions
node1: Exported generic functions
node1: Exported generic functions
node2: Exported generic functions
node2: Exported generic functions
nodes: Exported generic functions
nodes: Exported generic functions
nodes: Exported generic functions

O
other-edge-node: Exported generic functions
other-edge-node: Exported generic functions

P
print-edge-data: Exported generic functions
print-edge-data: Exported generic functions

Q
qappend: Internal generic functions
qappend: Internal generic functions
qitems: Internal generic functions
qitems: Internal generic functions
qlast: Internal generic functions
qlast: Internal generic functions
qpop: Internal generic functions
qpop: Internal generic functions
qpush: Internal generic functions
qpush: Internal generic functions

R
remove-connected-component: Exported functions
remove-edge: Exported generic functions
remove-edge: Exported generic functions
remove-edge-between-nodes: Exported generic functions
remove-edge-between-nodes: Exported generic functions
remove-keyword-args: Internal functions
remove-node: Exported generic functions
remove-node: Exported generic functions

S
self-edge-p: Exported generic functions
self-edge-p: Exported generic functions

W
with-graph-iterator: Internal macros

Jump to:   (  
A   B   C   D   E   F   G   M   N   O   P   Q   R   S   W  

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

A.3 Variables

Jump to:   *  
D   E   I   L   N   S  
Index Entry  Section

*
*bfs-depth*: Internal special variables
*default-edge-class*: Exported special variables
*default-graph-class*: Exported special variables
*dfs-depth*: Internal special variables

D
data: Exported classes

E
edges: Exported classes

I
items: Internal classes

L
last: Internal classes

N
node-hash: Exported classes
node-test: Exported classes
node1: Exported classes
node2: Exported classes

S
Slot, data: Exported classes
Slot, edges: Exported classes
Slot, items: Internal classes
Slot, last: Internal classes
Slot, node-hash: Exported classes
Slot, node-test: Exported classes
Slot, node1: Exported classes
Slot, node2: Exported classes
Special Variable, *bfs-depth*: Internal special variables
Special Variable, *default-edge-class*: Exported special variables
Special Variable, *default-graph-class*: Exported special variables
Special Variable, *dfs-depth*: Internal special variables

Jump to:   *  
D   E   I   L   N   S  

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

A.4 Data types

Jump to:   C   E   G   P   Q   S  
Index Entry  Section

C
Class, edge: Exported classes
Class, graph: Exported classes
Class, q: Internal classes
Class, simple-edge-list-graph: Exported classes

E
edge: Exported classes
epigraph: The epigraph system
epigraph: The epigraph package

G
graph: Exported classes

P
Package, epigraph: The epigraph package

Q
q: Internal classes

S
simple-edge-list-graph: Exported classes
System, epigraph: The epigraph system

Jump to:   C   E   G   P   Q   S