Class Graph-Matrix-Edge

Stub for matrix based graph. Not implemented.

Part of:

package cl-graph, class basic-edge

Direct Superclass

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

Slot

color
The `color` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]
Initargs:color; Accessors:color.
edge-id
The `edge-id` is used internally by CL-Graph for bookkeeping.
Initform:0, Initargs:edge-id; Accessors:edge-id.
elementInitargs:element, value; Accessors:value, element.
graph
The `graph` of which this edge is a part.
Initargs:graph; Reader:graph.
tag
The `tag` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]
Initargs:tag; Accessors:tag.

Other Method

add-edgeAdd-edge adds an existing edge to a graph. As add-edge-between-vertexes is generally more natural...
add-edge-to-vertexAttaches the edge `edge` to the vertex `vertex`.
delete-edgeDelete the `edge' from the `graph' and returns it.
directed-edge-pReturns true if-and-only-if edge is directed
edge->dotUsed by graph->dot to output edge formatting for `edge` onto the `stream`. The function can assum...
edge-lessp-by-directionReturns true if and only if edge-1 is undirected and edge-2 is directed.
edge-lessp-by-weightReturns true if the weight of edge-1 is strictly less than the weight of edge-2.
find-vertexSearch 'graph' for a vertex with element 'value'. The search is fast but inflexible because it us...
find-vertex-ifReturns the first vertex in `thing` for which the `predicate` function returns non-nil. If the `k...
iterate-vertexesCalls `fn` on each of the vertexes of `thing`.
out-edge-for-vertex-pReturns true if the edge is connected to vertex and is either an undirected edge or a directed ed...
tagged-edge-pReturns true if-and-only-if edge's tag slot is t
undirected-edge-pReturns true if-and-only-if edge is undirected
untagged-edge-pReturns true if-and-only-if edge's tage slot is nil
weightReturns the weight of an edge. This defaults to 1.0 and can only be altered if the edge is a sub-...