This is the root class for edges in graph-containers. It adds vertex-1 and vertex-2 slots.
This is the root class for all edges in CL-Graph.
A graph-container-directed-edge is both a directed-edge-mixin and a graph-container-edge.
A weighted edge is both a weighted-edge-mixin and a graph-container-edge.
The `color` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]Initargs::color; Accessors:color.
The `edge-id` is used internally by CL-Graph for bookkeeping.Initform:0, Initargs::edge-id; Accessors:edge-id.
|element||Initargs::element,:value; Accessors:element, value.|
The `graph` of which this edge is a part.Initargs::graph; Reader:graph.
The `tag` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin]Initargs::tag; Accessors:tag.
`Vertex-1` is one of the two vertexes that an edge connects. In a directed-edge, `vertex-1` is also the `source-edge`.Initargs::vertex-1; Reader:vertex-1.
`Vertex-2` is one of the two vertexes that an edge connects. In a directed edge, `vertex-2` is also the `target-vertex`.Initargs::vertex-2; Reader:vertex-2.
Add-edge adds an existing edge to a graph. As
Attaches the edge
Assuming that the value-or-vertex corresponds to
Returns the source-vertex of a directed
Returns the target-vertex of a directed
Returns a list of the vertexes of
Returns true if-and-only-if edge is directed
Used by graph->dot to output edge formatting for
Returns true if and only if edge-1 is undirected and edge-2 is directed.
Returns true if the weight of edge-1 is strictly less than the weight of edge-2.
Search 'graph' for a vertex with element
Returns the first vertex in
Returns true if the edge is connected to vertex and
Returns true if-and-only-if edge's tag slot is t
Returns true if-and-only-if edge is undirected
Returns true if-and-only-if edge's tage slot is nil
Returns the weight of an edge. This defaults to 1.0