The graph Reference Manual

This is the graph Reference Manual, version 0.0.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sat Dec 03 21:34:58 2022 GMT+0.

Table of Contents


1 Introduction


2 Systems

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


2.1 graph

simple library for building and manipulating graphs

Authors

Eric Schulte <>
Thomas Dye

License

MIT

Version

0.0.0

Defsystem Dependency

asdf-package-system (system).

Dependencies
  • alexandria (system).
  • metabang-bind (system).
  • named-readtables (system).
  • curry-compose-reader-macros (system).
  • graph/graph (system).
Source

graph.asd.


2.2 graph/graph

Authors

Eric Schulte <>
Thomas Dye

License

MIT

Dependencies
  • alexandria (system).
  • metabang-bind (system).
  • named-readtables (system).
  • curry-compose-reader-macros (system).
  • damn-fast-priority-queue (system).
Source

graph.asd.


3 Files

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


3.1 Lisp


3.1.1 graph/graph.asd

Source

graph.asd.

Parent Component

graph (system).

ASDF Systems

3.1.2 graph/graph/file-type.lisp

Source

graph.asd.

Parent Component

graph/graph (system).

Packages

graph/graph.

Public Interface
Internals

4 Packages

Packages are listed by definition order.


4.1 graph/graph

Source

file-type.lisp.

Nickname

graph

Use List
  • alexandria.
  • common-lisp.
  • curry-compose-reader-macros.
  • editor-hints.named-readtables.
  • metabang.bind.
Public Interface
Internals

5 Definitions

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


5.1 Public Interface


5.1.1 Ordinary functions

Function: edgar-gilbert-digraph (n p)
Package

graph/graph.

Source

file-type.lisp.

Function: edgar-gilbert-graph (n p)
Package

graph/graph.

Source

file-type.lisp.

Function: erdos-renyi-digraph (n m)

Return an Erdős–Rényi digraph with N nodes and M edges.

Package

graph/graph.

Source

file-type.lisp.

Function: erdos-renyi-graph (n m)

Return an Erdős–Rényi graph with N nodes and M edges.

Package

graph/graph.

Source

file-type.lisp.


5.1.2 Generic functions

Generic Function: add-edge (graph edge &optional value)

Add EDGE to GRAPH with optional VALUE. The nodes of EDGE are also added to GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: add-edge ((graph graph) edge &optional value)
Generic Function: add-node (graph node)

Add NODE to GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: add-node ((graph graph) node)
Generic Function: add-paths (graph path1 path2)

Return the combination of paths PATH1 and PATH2 through GRAPH. Each element of PATH has the form (cons edge value).

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: add-paths ((digraph digraph) path1 path2)

Return the combination of paths PATH1 and PATH2 through DIGRAPH. Each element of path has the form (cons edge value).

Method: add-paths ((graph graph) path1 path2)
Generic Function: adjacent-from (digraph node)

List nodes adjacent from NODE in DIGRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: adjacent-from ((digraph digraph) node)
Generic Function: adjacent-to (digraph node)

List nodes adjacent to NODE in DIGRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: adjacent-to ((digraph digraph) node)
Generic Function: all-paths (graph a b)

Return all paths in GRAPH from A to B.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: all-paths ((graph graph) a b)
Generic Function: basic-cycles (graph)

Return all basic cycles in the GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: basic-cycles ((graph graph))
Generic Function: betweenness (graph node &optional heuristic)

Fraction of shortest paths through GRAPH which pass through NODE. Fraction of node pairs (s,t) s.t. s and t ≠ NODE and the shortest path between s and t in GRAPH passes through NODE.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: betweenness ((graph graph) node &optional heuristic)
Generic Function: carrierp (digraph node)

Returns t if node is a carrier, i.e., both indegree and outdegree are 1.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: carrierp ((digraph digraph) node)
Generic Function: carriers (digraph)

Return a list of the carrier nodes in digraph.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: carriers ((digraph digraph))
Generic Function: cliques (graph)

Return the maximal cliques of GRAPH. The Bron-Kerbosh algorithm is used.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: cliques ((graph graph))
Generic Function: closedp (graph nodes)

Return true if NODES are fully connected in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: closedp ((graph graph) nodes)
Generic Function: closeness (graph node)

Inverse of the ‘farness’ for NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: closeness ((graph graph) node)
Generic Function: clustering-coefficient (graph)

Fraction of connected triples which are closed.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: clustering-coefficient ((graph graph))
Generic Function: connected-component (graph node &key type)

Return the connected component of NODE in GRAPH.
The TYPE keyword argument only has an effect for directed graphs in which it may be set to one of the following with :STRONG being the default value.

:STRONG ..... connections only traverse edges along the direction of the edge

:WEAK ....... connections may traverse edges in any direction regardless of the edge direction

:UNILATERAL . two nodes a and b connected iff a is strongly connected to b or b is strongly connected to a

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: connected-component ((digraph digraph) node &key type)
Method: connected-component ((graph graph) node &key type)
Generic Function: connected-components (graph &key type)

Return a list of the connected components of GRAPH.
Keyword TYPE is passed to ‘connected-component’ and only has effect for directed graphs. Returns strongly connected components of a directed graph by default.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: connected-components ((graph graph) &key type)
Generic Function: connected-groups-of-size (graph size)

Return all connected node groups of SIZE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: connected-groups-of-size ((graph graph) size)
Generic Function: connectedp (graph &key type)

Return true if the graph is connected.
TYPE keyword argument is passed to ‘connected-components’.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: connectedp ((digraph digraph) &key type)
Method: connectedp ((graph graph) &key type)
Generic Function: copy (graph)

Return a copy of GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: copy ((graph graph))
Generic Function: cycles (graph)

Return all cycles of GRAPH (both basic and compound).

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: cycles ((graph graph))
Generic Function: degeneracy (graph)

Return the degeneracy and k-cores of GRAPH.
Also return the node ordering with optimal coloring number as an alist. The ‘car’ of each element of the alist identifies k-cores and the ‘cdr’ holds the nodes in the ordering.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: degeneracy ((graph graph))
Generic Function: degree (graph node)

Return the degree of NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: degree ((graph graph) node)
Generic Function: delete-edge (graph edge)

Delete EDGE from GRAPH. Return the old value of EDGE.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: delete-edge ((graph graph) edge)
Generic Function: delete-node (graph node)

Delete NODE from GRAPH.
Delete and return the old edges of NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: delete-node ((graph graph) node)
Generic Function: digraph-of (graph)

Copy GRAPH into a ‘digraph’ and return.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: digraph-of ((graph graph))
Generic Function: edgar-gilbert-populate (graph p)

Populate GRAPH including every possible edge with probability P.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: edgar-gilbert-populate ((digraph digraph) p)
Method: edgar-gilbert-populate ((graph graph) p)
Generic Function: edge-neighbors (graph edge)

Return all edges which share a node with EDGE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: edge-neighbors ((graph graph) edge)
Generic Function: edge-value (graph edge)

Return the value of EDGE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: edge-value ((graph graph) edge)
Generic Function: (setf edge-value) (graph edge)

Set the value of EDGE in GRAPH to NEW.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: (setf edge-value) ((graph graph) edge)
Generic Function: edges (graph)

Return a list of the edges in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: edges ((graph graph))
Generic Function: (setf edges) (graph)

Set the edges in GRAPH to NEW.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: (setf edges) ((graph graph))
Generic Function: edges-w-values (graph)

Return an alist of edges of GRAPH with their values.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: edges-w-values ((graph graph))
Generic Function: (setf edges-w-values) (graph)

Set the edges of graph to edges and values in NEW.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: (setf edges-w-values) ((graph graph))
Generic Function: erdos-renyi-populate (graph m)

Populate GRAPH with M edges in an Erdős–Rényi random graph model.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: erdos-renyi-populate ((graph graph) m)
Generic Function: farness (graph node &optional heuristic)

Sum of the distance from NODE to every other node in connected GRAPH. Optional argument HEURISTIC if supplied is passed through to guide the A* search used in ‘shortest-path’.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: farness ((graph graph) node &optional heuristic)
Generic Function: from-plist (graph plist)

Populate GRAPH with the contents of PLIST.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: from-plist ((graph graph) plist)
Generic Function: from-value-matrix (graph matrix)

Populate GRAPH from the value matrix MATRIX.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: from-value-matrix ((graph graph) matrix)
Generic Function: graph-equal (graph1 graph2)

Compare GRAPH1 and GRAPH2 for equality.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: graph-equal ((graph1 graph) (graph2 graph))
Generic Function: graph-of (digraph)

Copy DIGRAPH into a ‘graph’ and return.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: graph-of ((digraph digraph))
Generic Function: has-edge-p (graph edge)

Return ‘true’ if GRAPH has edge EDGE.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: has-edge-p ((graph graph) edge)
Generic Function: has-node-p (graph node)

Return ‘true’ if GRAPH has node NODE.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: has-node-p ((graph graph) node)
Generic Function: indegree (digraph node)

The number of edges directed to NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: indegree ((digraph digraph) node)
Generic Function: isolatep (digraph node)

Returns t if node is an isolate, i.e., both indegree and outdegree are 0.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: isolatep ((digraph digraph) node)
Generic Function: isolates (digraph)

Return a list of the isolated nodes in digraph.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: isolates ((digraph digraph))
Generic Function: k-cores (graph)

Return the k-cores of GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: k-cores ((graph graph))
Generic Function: katz-centrality (graph node &key attenuation heuristic)

Combined measure of number and nearness of nodes to NODE.
Keyword argument HEURISTIC if supplied is passed through to guide the A* search used in ‘shortest-path’.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: katz-centrality ((graph graph) node &key attenuation heuristic)
Generic Function: levels (digraph &key alist)

Assign a positive integer to each node in DIGRAPH,
called its level, where, for each directed edge (a b) the corresponding integers satisfy a < b. Returns either a hash table where the nodes are keys and the levels are values, or an association list of nodes and their levels, along with the number of levels in DIGRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: levels (digraph &key alist)
Generic Function: max-flow (graph from to &optional heuristic)

Return the maximum flow from FROM and to TO in GRAPH.
GRAPHS must be a network with numeric values of all edges (otherwise a default cost of 1 is used for every edge). The Ford-Fulkerson algorithm is used. Optional argument HEURISTIC if supplied is passed through to guide the A* search used in ‘shortest-path’.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: max-flow ((digraph digraph) from to &optional heuristic)
Generic Function: merge-edges (graph edge1 edge2 &key value)

Combine EDGE1 and EDGE2 in GRAPH into a new EDGE.
Optionally provide a value for the new edge, the values of EDGE1 and EDGE2 will be combined.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: merge-edges ((graph graph) edge1 edge2 &key value)
Generic Function: merge-nodes (graph node1 node2 &key new)

Combine NODE1 and NODE2 in GRAPH into the node NEW.
All edges of NODE1 and NODE2 in GRAPH will be combined into a new node of value NEW. Edges between only NODE1 and NODE2 will be removed.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: merge-nodes ((graph graph) node1 node2 &key new)
Generic Function: min-cut (graph)

Return both the global min-cut of GRAPH and the weight of the cut.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: min-cut ((graph graph))
Generic Function: minimum-spanning-tree (graph &optional tree)

Return a minimum spanning tree of GRAPH.
Prim’s algorithm is used. Optional argument TREE may be used to specify an initial tree, otherwise a random node is used.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: minimum-spanning-tree ((graph graph) &optional tree)
Generic Function: neighbors (graph node)

Return all nodes which share an edge with NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: neighbors ((digraph digraph) node)
Method: neighbors ((graph graph) node)
Generic Function: node-edges (graph node)

Return the value of NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: node-edges ((graph graph) node)
Generic Function: (setf node-edges) (graph node)

Set the edges of NODE in GRAPH to NEW.
Delete and return the old edges of NODE in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: (setf node-edges) ((graph graph) node)
Generic Function: nodes (graph)

Return a list of the nodes in GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: nodes ((graph graph))
Generic Function: (setf nodes) (graph)

Set the nodes in GRAPH to NEW.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: (setf nodes) ((graph graph))
Generic Function: nodes-w-values (graph)

Return an alist of nodes of GRAPH with their values.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: nodes-w-values ((graph graph))
Generic Function: ordinaries (digraph)

Return a list of the ordinary nodes in digraph.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: ordinaries ((digraph digraph))
Generic Function: ordinaryp (digraph node)

Returns t if node is ordinary, i.e., is not a transmitter, receiver, isolate, or carrier.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: ordinaryp ((digraph digraph) node)
Generic Function: outdegree (digraph node)

The number of edges directed from NODE in DIGRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: outdegree ((digraph digraph) node)
Generic Function: populate (graph &key nodes edges edges-w-values)

Populate the nodes and edges of GRAPH based on keyword arguments.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: populate ((graph graph) &key nodes edges edges-w-values)
Generic Function: precedents (digraph node)

Return all nodes preceding NODE in an edge of DIGRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: precedents ((digraph digraph) node)
Generic Function: preferential-attachment-populate (graph nodes &key edge-vals)

Add NODES to GRAPH using preferential attachment, return the new edges. Optionally assign edge values from those listed in EDGE-VALS.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: preferential-attachment-populate ((graph graph) nodes &key edge-vals)
Generic Function: receiverp (digraph node)

Returns t if node is a receiver, i.e., has outdegree of 0 and positive indegree.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: receiverp ((digraph digraph) node)
Generic Function: receivers (digraph)

Return a list of the receivers in digraph.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: receivers ((digraph digraph))
Generic Function: residual (graph flow)

Return the residual graph of GRAPH with FLOW.
Each edge in the residual has a value equal to the original capacity minus the current flow, or equal to the negative of the current flow.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: residual ((graph graph) flow)
Generic Function: reverse-edges (graph)

Return a copy of GRAPH with all edges reversed.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: reverse-edges ((graph graph))
Generic Function: shortest-path (graph a b &optional heuristic)

Return the shortest path in GRAPH from A to B.
Implemented using A* search. Optional argument HEURISTIC may be a function which returns an estimated heuristic cost from an node to the target B. The default value for HEURISTIC is the constant function of 0, reducing this implementation to Dijkstra’s algorithm. The HEURISTIC function must satisfy HEURITIC(x)≤d(x,y)+HEURITIC(y) ∀ x,y in GRAPH allowing the more efficient monotonic or "consistent" implementation of A*.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: shortest-path ((graph graph) a b &optional heuristic)
Generic Function: strongly-connected-components (graph)

Return the nodes of GRAPH partitioned into strongly connected components. Uses Tarjan’s algorithm.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: strongly-connected-components ((graph graph))
Generic Function: subgraph (graph nodes)

Return the subgraph of GRAPH restricted to NODES.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: subgraph ((graph graph) nodes)
Generic Function: to-plist (graph &key node-fn edge-fn)

Serialize GRAPH as a plist.
Keyword arguments NODE-FN and EDGE-FN will be called on a node or edge and should return a plist of data to associate with the given node or edge in the results.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: to-plist ((graph graph) &key node-fn edge-fn)
Generic Function: to-value-matrix (graph)

Return the value matrix of GRAPH.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: to-value-matrix ((graph graph))
Generic Function: topological-sort (digraph)

Returns a topologically ordered list of the nodes in DIGRAPH, such that, for each edge in DIGRAPH, the start of the edge appears in the list before the end of the edge.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: topological-sort (digraph)
Generic Function: transmitterp (digraph node)

Returns t if node is a transmitter, i.e., has indegree of 0 and positive outdegree.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: transmitterp ((digraph digraph) node)
Generic Function: transmitters (digraph)

Return a list of the transmitters in digraph.

Package

graph/graph.

Source

file-type.lisp.

Methods
Method: transmitters ((digraph digraph))

5.1.3 Classes

Class: digraph

A ‘graph’ with directed edges.

Package

graph/graph.

Source

file-type.lisp.

Direct superclasses

graph.

Direct methods
Direct slots
Slot: edge-h
Initform

(graph/graph::make-diedge-hash-table)

Initargs

:edge-h

Readers

edge-h.

Writers

(setf edge-h).

Slot: edge-eq
Initform

(quote graph/graph::dir-edge-equalp)

Initargs

:edge-eq

Readers

edge-eq.

Writers

(setf edge-eq).

Class: graph

A graph consisting of ‘nodes’ connected by ‘edges’.
Nodes must be numbers symbols or keywords. Edges may be assigned arbitrary values, although some functions assume numeric values (e.g., ‘merge-nodes’, ‘merge-edges’, ‘max-flow’ and ‘min-cut’).

Package

graph/graph.

Source

file-type.lisp.

Direct subclasses

digraph.

Direct methods
Direct slots
Slot: node-h
Initform

(make-hash-table)

Initargs

:node-h

Readers

node-h.

Writers

(setf node-h).

Slot: edge-h
Initform

(graph/graph::make-edge-hash-table)

Initargs

:edge-h

Readers

edge-h.

Writers

(setf edge-h).

Slot: edge-eq
Initform

(quote graph/graph::edge-equalp)

Initargs

:edge-eq

Readers

edge-eq.

Writers

(setf edge-eq).


5.2 Internals


5.2.1 Ordinary functions

Function: connected-component- (node neighbor-fn)
Package

graph/graph.

Source

file-type.lisp.

Function: copy-hash (hash &optional test comb)

Return a copy of HASH.
Optional argument TEST specifies a new equality test to use for the copy. Second optional argument COMB specifies a function to use to combine the values of elements of HASH which collide in the copy due to a new equality test specified with TEST.

Package

graph/graph.

Source

file-type.lisp.

Function: dir-edge-equalp (edge1 edge2)
Package

graph/graph.

Source

file-type.lisp.

Function: edge-equalp (edge1 edge2)
Package

graph/graph.

Source

file-type.lisp.

Function: edge-hash-equal (hash1 hash2)

Test edge hashes HASH1 and HASH2 for equality.

Package

graph/graph.

Source

file-type.lisp.

Function: make-diedge-hash-table ()
Package

graph/graph.

Source

file-type.lisp.

Function: make-edge-hash-table ()
Package

graph/graph.

Source

file-type.lisp.

Function: node-hash-equal (hash1 hash2)

Test node hashes HASH1 and HASH2 for equality.

Package

graph/graph.

Source

file-type.lisp.

Function: sxhash-edge (edge)
Package

graph/graph.

Source

file-type.lisp.

Function: weigh-cut (graph cut)
Package

graph/graph.

Source

file-type.lisp.


5.2.2 Generic functions

Generic Reader: edge-eq (object)
Package

graph/graph.

Methods
Reader Method: edge-eq ((digraph digraph))

automatically generated reader method

Source

file-type.lisp.

Target Slot

edge-eq.

Reader Method: edge-eq ((graph graph))

automatically generated reader method

Source

file-type.lisp.

Target Slot

edge-eq.

Generic Writer: (setf edge-eq) (object)
Package

graph/graph.

Methods
Writer Method: (setf edge-eq) ((digraph digraph))

automatically generated writer method

Source

file-type.lisp.

Target Slot

edge-eq.

Writer Method: (setf edge-eq) ((graph graph))

automatically generated writer method

Source

file-type.lisp.

Target Slot

edge-eq.

Generic Reader: edge-h (object)
Package

graph/graph.

Methods
Reader Method: edge-h ((digraph digraph))

automatically generated reader method

Source

file-type.lisp.

Target Slot

edge-h.

Reader Method: edge-h ((graph graph))

automatically generated reader method

Source

file-type.lisp.

Target Slot

edge-h.

Generic Writer: (setf edge-h) (object)
Package

graph/graph.

Methods
Writer Method: (setf edge-h) ((digraph digraph))

automatically generated writer method

Source

file-type.lisp.

Target Slot

edge-h.

Writer Method: (setf edge-h) ((graph graph))

automatically generated writer method

Source

file-type.lisp.

Target Slot

edge-h.

Generic Reader: node-h (object)
Package

graph/graph.

Methods
Reader Method: node-h ((graph graph))

automatically generated reader method

Source

file-type.lisp.

Target Slot

node-h.

Generic Writer: (setf node-h) (object)
Package

graph/graph.

Methods
Writer Method: (setf node-h) ((graph graph))

automatically generated writer method

Source

file-type.lisp.

Target Slot

node-h.


Appendix A Indexes


A.1 Concepts


A.2 Functions

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

(
(setf edge-eq): Private generic functions
(setf edge-eq): Private generic functions
(setf edge-eq): Private generic functions
(setf edge-h): Private generic functions
(setf edge-h): Private generic functions
(setf edge-h): Private generic functions
(setf edge-value): Public generic functions
(setf edge-value): Public generic functions
(setf edges): Public generic functions
(setf edges): Public generic functions
(setf edges-w-values): Public generic functions
(setf edges-w-values): Public generic functions
(setf node-edges): Public generic functions
(setf node-edges): Public generic functions
(setf node-h): Private generic functions
(setf node-h): Private generic functions
(setf nodes): Public generic functions
(setf nodes): Public generic functions

A
add-edge: Public generic functions
add-edge: Public generic functions
add-node: Public generic functions
add-node: Public generic functions
add-paths: Public generic functions
add-paths: Public generic functions
add-paths: Public generic functions
adjacent-from: Public generic functions
adjacent-from: Public generic functions
adjacent-to: Public generic functions
adjacent-to: Public generic functions
all-paths: Public generic functions
all-paths: Public generic functions

B
basic-cycles: Public generic functions
basic-cycles: Public generic functions
betweenness: Public generic functions
betweenness: Public generic functions

C
carrierp: Public generic functions
carrierp: Public generic functions
carriers: Public generic functions
carriers: Public generic functions
cliques: Public generic functions
cliques: Public generic functions
closedp: Public generic functions
closedp: Public generic functions
closeness: Public generic functions
closeness: Public generic functions
clustering-coefficient: Public generic functions
clustering-coefficient: Public generic functions
connected-component: Public generic functions
connected-component: Public generic functions
connected-component: Public generic functions
connected-component-: Private ordinary functions
connected-components: Public generic functions
connected-components: Public generic functions
connected-groups-of-size: Public generic functions
connected-groups-of-size: Public generic functions
connectedp: Public generic functions
connectedp: Public generic functions
connectedp: Public generic functions
copy: Public generic functions
copy: Public generic functions
copy-hash: Private ordinary functions
cycles: Public generic functions
cycles: Public generic functions

D
degeneracy: Public generic functions
degeneracy: Public generic functions
degree: Public generic functions
degree: Public generic functions
delete-edge: Public generic functions
delete-edge: Public generic functions
delete-node: Public generic functions
delete-node: Public generic functions
digraph-of: Public generic functions
digraph-of: Public generic functions
dir-edge-equalp: Private ordinary functions

E
edgar-gilbert-digraph: Public ordinary functions
edgar-gilbert-graph: Public ordinary functions
edgar-gilbert-populate: Public generic functions
edgar-gilbert-populate: Public generic functions
edgar-gilbert-populate: Public generic functions
edge-eq: Private generic functions
edge-eq: Private generic functions
edge-eq: Private generic functions
edge-equalp: Private ordinary functions
edge-h: Private generic functions
edge-h: Private generic functions
edge-h: Private generic functions
edge-hash-equal: Private ordinary functions
edge-neighbors: Public generic functions
edge-neighbors: Public generic functions
edge-value: Public generic functions
edge-value: Public generic functions
edges: Public generic functions
edges: Public generic functions
edges-w-values: Public generic functions
edges-w-values: Public generic functions
erdos-renyi-digraph: Public ordinary functions
erdos-renyi-graph: Public ordinary functions
erdos-renyi-populate: Public generic functions
erdos-renyi-populate: Public generic functions

F
farness: Public generic functions
farness: Public generic functions
from-plist: Public generic functions
from-plist: Public generic functions
from-value-matrix: Public generic functions
from-value-matrix: Public generic functions
Function, connected-component-: Private ordinary functions
Function, copy-hash: Private ordinary functions
Function, dir-edge-equalp: Private ordinary functions
Function, edgar-gilbert-digraph: Public ordinary functions
Function, edgar-gilbert-graph: Public ordinary functions
Function, edge-equalp: Private ordinary functions
Function, edge-hash-equal: Private ordinary functions
Function, erdos-renyi-digraph: Public ordinary functions
Function, erdos-renyi-graph: Public ordinary functions
Function, make-diedge-hash-table: Private ordinary functions
Function, make-edge-hash-table: Private ordinary functions
Function, node-hash-equal: Private ordinary functions
Function, sxhash-edge: Private ordinary functions
Function, weigh-cut: Private ordinary functions

G
Generic Function, (setf edge-eq): Private generic functions
Generic Function, (setf edge-h): Private generic functions
Generic Function, (setf edge-value): Public generic functions
Generic Function, (setf edges): Public generic functions
Generic Function, (setf edges-w-values): Public generic functions
Generic Function, (setf node-edges): Public generic functions
Generic Function, (setf node-h): Private generic functions
Generic Function, (setf nodes): Public generic functions
Generic Function, add-edge: Public generic functions
Generic Function, add-node: Public generic functions
Generic Function, add-paths: Public generic functions
Generic Function, adjacent-from: Public generic functions
Generic Function, adjacent-to: Public generic functions
Generic Function, all-paths: Public generic functions
Generic Function, basic-cycles: Public generic functions
Generic Function, betweenness: Public generic functions
Generic Function, carrierp: Public generic functions
Generic Function, carriers: Public generic functions
Generic Function, cliques: Public generic functions
Generic Function, closedp: Public generic functions
Generic Function, closeness: Public generic functions
Generic Function, clustering-coefficient: Public generic functions
Generic Function, connected-component: Public generic functions
Generic Function, connected-components: Public generic functions
Generic Function, connected-groups-of-size: Public generic functions
Generic Function, connectedp: Public generic functions
Generic Function, copy: Public generic functions
Generic Function, cycles: Public generic functions
Generic Function, degeneracy: Public generic functions
Generic Function, degree: Public generic functions
Generic Function, delete-edge: Public generic functions
Generic Function, delete-node: Public generic functions
Generic Function, digraph-of: Public generic functions
Generic Function, edgar-gilbert-populate: Public generic functions
Generic Function, edge-eq: Private generic functions
Generic Function, edge-h: Private generic functions
Generic Function, edge-neighbors: Public generic functions
Generic Function, edge-value: Public generic functions
Generic Function, edges: Public generic functions
Generic Function, edges-w-values: Public generic functions
Generic Function, erdos-renyi-populate: Public generic functions
Generic Function, farness: Public generic functions
Generic Function, from-plist: Public generic functions
Generic Function, from-value-matrix: Public generic functions
Generic Function, graph-equal: Public generic functions
Generic Function, graph-of: Public generic functions
Generic Function, has-edge-p: Public generic functions
Generic Function, has-node-p: Public generic functions
Generic Function, indegree: Public generic functions
Generic Function, isolatep: Public generic functions
Generic Function, isolates: Public generic functions
Generic Function, k-cores: Public generic functions
Generic Function, katz-centrality: Public generic functions
Generic Function, levels: Public generic functions
Generic Function, max-flow: Public generic functions
Generic Function, merge-edges: Public generic functions
Generic Function, merge-nodes: Public generic functions
Generic Function, min-cut: Public generic functions
Generic Function, minimum-spanning-tree: Public generic functions
Generic Function, neighbors: Public generic functions
Generic Function, node-edges: Public generic functions
Generic Function, node-h: Private generic functions
Generic Function, nodes: Public generic functions
Generic Function, nodes-w-values: Public generic functions
Generic Function, ordinaries: Public generic functions
Generic Function, ordinaryp: Public generic functions
Generic Function, outdegree: Public generic functions
Generic Function, populate: Public generic functions
Generic Function, precedents: Public generic functions
Generic Function, preferential-attachment-populate: Public generic functions
Generic Function, receiverp: Public generic functions
Generic Function, receivers: Public generic functions
Generic Function, residual: Public generic functions
Generic Function, reverse-edges: Public generic functions
Generic Function, shortest-path: Public generic functions
Generic Function, strongly-connected-components: Public generic functions
Generic Function, subgraph: Public generic functions
Generic Function, to-plist: Public generic functions
Generic Function, to-value-matrix: Public generic functions
Generic Function, topological-sort: Public generic functions
Generic Function, transmitterp: Public generic functions
Generic Function, transmitters: Public generic functions
graph-equal: Public generic functions
graph-equal: Public generic functions
graph-of: Public generic functions
graph-of: Public generic functions

H
has-edge-p: Public generic functions
has-edge-p: Public generic functions
has-node-p: Public generic functions
has-node-p: Public generic functions

I
indegree: Public generic functions
indegree: Public generic functions
isolatep: Public generic functions
isolatep: Public generic functions
isolates: Public generic functions
isolates: Public generic functions

K
k-cores: Public generic functions
k-cores: Public generic functions
katz-centrality: Public generic functions
katz-centrality: Public generic functions

L
levels: Public generic functions
levels: Public generic functions

M
make-diedge-hash-table: Private ordinary functions
make-edge-hash-table: Private ordinary functions
max-flow: Public generic functions
max-flow: Public generic functions
merge-edges: Public generic functions
merge-edges: Public generic functions
merge-nodes: Public generic functions
merge-nodes: Public generic functions
Method, (setf edge-eq): Private generic functions
Method, (setf edge-eq): Private generic functions
Method, (setf edge-h): Private generic functions
Method, (setf edge-h): Private generic functions
Method, (setf edge-value): Public generic functions
Method, (setf edges): Public generic functions
Method, (setf edges-w-values): Public generic functions
Method, (setf node-edges): Public generic functions
Method, (setf node-h): Private generic functions
Method, (setf nodes): Public generic functions
Method, add-edge: Public generic functions
Method, add-node: Public generic functions
Method, add-paths: Public generic functions
Method, add-paths: Public generic functions
Method, adjacent-from: Public generic functions
Method, adjacent-to: Public generic functions
Method, all-paths: Public generic functions
Method, basic-cycles: Public generic functions
Method, betweenness: Public generic functions
Method, carrierp: Public generic functions
Method, carriers: Public generic functions
Method, cliques: Public generic functions
Method, closedp: Public generic functions
Method, closeness: Public generic functions
Method, clustering-coefficient: Public generic functions
Method, connected-component: Public generic functions
Method, connected-component: Public generic functions
Method, connected-components: Public generic functions
Method, connected-groups-of-size: Public generic functions
Method, connectedp: Public generic functions
Method, connectedp: Public generic functions
Method, copy: Public generic functions
Method, cycles: Public generic functions
Method, degeneracy: Public generic functions
Method, degree: Public generic functions
Method, delete-edge: Public generic functions
Method, delete-node: Public generic functions
Method, digraph-of: Public generic functions
Method, edgar-gilbert-populate: Public generic functions
Method, edgar-gilbert-populate: Public generic functions
Method, edge-eq: Private generic functions
Method, edge-eq: Private generic functions
Method, edge-h: Private generic functions
Method, edge-h: Private generic functions
Method, edge-neighbors: Public generic functions
Method, edge-value: Public generic functions
Method, edges: Public generic functions
Method, edges-w-values: Public generic functions
Method, erdos-renyi-populate: Public generic functions
Method, farness: Public generic functions
Method, from-plist: Public generic functions
Method, from-value-matrix: Public generic functions
Method, graph-equal: Public generic functions
Method, graph-of: Public generic functions
Method, has-edge-p: Public generic functions
Method, has-node-p: Public generic functions
Method, indegree: Public generic functions
Method, isolatep: Public generic functions
Method, isolates: Public generic functions
Method, k-cores: Public generic functions
Method, katz-centrality: Public generic functions
Method, levels: Public generic functions
Method, max-flow: Public generic functions
Method, merge-edges: Public generic functions
Method, merge-nodes: Public generic functions
Method, min-cut: Public generic functions
Method, minimum-spanning-tree: Public generic functions
Method, neighbors: Public generic functions
Method, neighbors: Public generic functions
Method, node-edges: Public generic functions
Method, node-h: Private generic functions
Method, nodes: Public generic functions
Method, nodes-w-values: Public generic functions
Method, ordinaries: Public generic functions
Method, ordinaryp: Public generic functions
Method, outdegree: Public generic functions
Method, populate: Public generic functions
Method, precedents: Public generic functions
Method, preferential-attachment-populate: Public generic functions
Method, receiverp: Public generic functions
Method, receivers: Public generic functions
Method, residual: Public generic functions
Method, reverse-edges: Public generic functions
Method, shortest-path: Public generic functions
Method, strongly-connected-components: Public generic functions
Method, subgraph: Public generic functions
Method, to-plist: Public generic functions
Method, to-value-matrix: Public generic functions
Method, topological-sort: Public generic functions
Method, transmitterp: Public generic functions
Method, transmitters: Public generic functions
min-cut: Public generic functions
min-cut: Public generic functions
minimum-spanning-tree: Public generic functions
minimum-spanning-tree: Public generic functions

N
neighbors: Public generic functions
neighbors: Public generic functions
neighbors: Public generic functions
node-edges: Public generic functions
node-edges: Public generic functions
node-h: Private generic functions
node-h: Private generic functions
node-hash-equal: Private ordinary functions
nodes: Public generic functions
nodes: Public generic functions
nodes-w-values: Public generic functions
nodes-w-values: Public generic functions

O
ordinaries: Public generic functions
ordinaries: Public generic functions
ordinaryp: Public generic functions
ordinaryp: Public generic functions
outdegree: Public generic functions
outdegree: Public generic functions

P
populate: Public generic functions
populate: Public generic functions
precedents: Public generic functions
precedents: Public generic functions
preferential-attachment-populate: Public generic functions
preferential-attachment-populate: Public generic functions

R
receiverp: Public generic functions
receiverp: Public generic functions
receivers: Public generic functions
receivers: Public generic functions
residual: Public generic functions
residual: Public generic functions
reverse-edges: Public generic functions
reverse-edges: Public generic functions

S
shortest-path: Public generic functions
shortest-path: Public generic functions
strongly-connected-components: Public generic functions
strongly-connected-components: Public generic functions
subgraph: Public generic functions
subgraph: Public generic functions
sxhash-edge: Private ordinary functions

T
to-plist: Public generic functions
to-plist: Public generic functions
to-value-matrix: Public generic functions
to-value-matrix: Public generic functions
topological-sort: Public generic functions
topological-sort: Public generic functions
transmitterp: Public generic functions
transmitterp: Public generic functions
transmitters: Public generic functions
transmitters: Public generic functions

W
weigh-cut: Private ordinary functions