Contents

Indexes:

This is the root class for all vertexes in CL-Graph.

container-node-mixin |
---|

graph-container-vertex | A graph container vertex keeps track of its edges in the the vertex-edges slot. The storage for t... |
---|---|

graph-matrix-vertex | Stub for matrix based graph. Not implemented. |

color | The `color` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin] Initargs::color; Accessors:color. |
---|---|

depth-level | `Depth-level` is used by some algorithms for bookkeeping. [?? Should be in a mixin] Initform:0, Initargs::depth-level; Accessors:depth-level; Type:number. |

discovery-time | `Discovery-time` is used by some algorithms for bookkeeping. [?? Should be in a mixin] Initform:-1, Initargs::discovery-time; Accessors:discovery-time. |

element | Initargs::element,:value; Accessors:element, value. |

finish-time | `Finish-time` is used by some algorithms for bookkeeping. [?? Should be in a mixin] Initform:-1, Initargs::finish-time; Accessors:finish-time. |

graph | The `graph` of which this edge is a part. Initargs::graph; Reader:graph. |

next-node | `Next-node` is used by some algorithms for bookkeeping. [?? Should be in a mixin] Initargs::next-node; Accessors:next-node. |

previous-node | `Previous-node` is used by some algorithms for bookkeeping. [?? Should be in a mixin] Initargs::previous-node; Accessors:previous-node. |

rank | The `rank` is used by some algorithms for bookkeeping. [?? Should be in a mixin] Initargs::rank; Accessors:rank. |

tag | The `tag` is used by some algorithms for bookkeeping. [?? Should probably be in a mixin] Initargs::tag; Accessors:tag. |

vertex-id | `Vertex-id` is used internally to keep track of vertexes. Initform:0, Initargs::vertex-id; Reader:vertex-id. |

add-edge-between-vertexes | Adds an edge between two vertexes and returns it. |
---|---|

add-edge-to-vertex | Attaches the edge |

add-vertex | Adds a vertex to a graph. If called with a vertex, |

adjacentp | Return true if vertex-1 and vertex-2 are connected |

assign-level | Sets the depth of |

breadth-first-search-graph | |

breadth-first-visitor | |

delete-vertex | Remove a vertex from a graph. The 'vertex-or-value' |

dfs | |

dfs-visit | |

edge-count | Returns the number of edges attached to |

edges | Returns a list of the edges of |

find-vertex | Search 'graph' for a vertex with element |

in-cycle-p | Returns true if |

in-undirected-cycle-p | Return true if-and-only-if an undirected cycle in |

make-edge-for-graph | It should not usually necessary to call this in |

map-over-all-combinations-of-k-edges | |

mst-find-set | |

mst-link | |

mst-make-set | |

mst-tree-union | |

out-edge-for-vertex-p | Returns true if the edge is connected to vertex and |

replace-vertex | Replace vertex |

rootp | Returns true if |

search-for-vertex | Search 'graph' for a vertex with element |

setfelement | |

source-edge-count | Returns the number of source edges of |

source-edges | Returns a list of the source edges of |

subgraph-containing | Returns a new graph that is a subset of |

tag-all-edges | Sets the |

target-edge-count | Returns the number of target edges of |

target-edges | Returns a list of the target edges of |

traverse-elements-helper | WIP |

untag-all-edges | Sets the |

vertex->dot | Unless a different vertex-formatter is specified |

search-for-node | |
---|---|

search-for-node* |