| add-edge | Add-edge adds an existing edge to a graph. As add-edge-between-vertexes is generally more natural... |
|---|
| add-edge-between-vertexes | Adds an edge between two vertexes and returns it.
If force-new? is true,
the edge is added eve... |
|---|
| add-edge-to-vertex | Attaches the edge `edge` to the vertex `vertex`. |
|---|
| add-edges-to-graph | |
|---|
| add-vertex | Adds a vertex to a graph. If called with a vertex, then this vertex is added. If called with a va... |
|---|
| adjacentp | Return true if vertex-1 and vertex-2 are connected by an edge. [?? compare with vertices-share-ed... |
|---|
| any-undirected-cycle-p | Returns true if there are any undirected cycles in `graph`. |
|---|
| assign-level | Sets the depth of `vertex` to level and then recursively sets the depth of all of the children of... |
|---|
| assortativity-coefficient | An assortative graph is one where vertexes of the same type are more likely to
have edges betwee... |
|---|
| breadth-first-search-graph | |
|---|
| breadth-first-visitor | |
|---|
| child-vertexes | Returns a list of the vertexes to which `vertex` is connected by an edge and for which `vertex` i... |
|---|
| complete-links | Add edges between vertexes in the new-graph for which the matching vertexes in the old-graph hav... |
|---|
| connected-component-count | Returns the number of connected-components of graph. |
|---|
| connected-components | Returns a union-find-container representing the connected-components of `graph`. |
|---|
| connected-graph-p | Returns true if graph is a connected graph and nil otherwise. |
|---|
| delete-edge | Delete the `edge' from the `graph' and returns it. |
|---|
| delete-edge-between-vertexes | Finds an edge in the graph between the two specified vertexes. If values (i.e., non-vertexes) are... |
|---|
| delete-vertex | Remove a vertex from a graph. The 'vertex-or-value' argument can be
a vertex of the graph or a 'v... |
|---|
| depth | Returns the maximum depth of the vertexes in graph assuming that the roots are of depth 0 and tha... |
|---|
| dfs | |
|---|
| dfs-back-edge-p | |
|---|
| dfs-cross-edge-p | |
|---|
| dfs-edge-type | |
|---|
| dfs-forward-edge-p | |
|---|
| dfs-tree-edge-p | |
|---|
| dfs-visit | |
|---|
| directed-edge-p | Returns true if-and-only-if edge is directed |
|---|
| dot-attribute-value | |
|---|
| edge->dot | Used by graph->dot to output edge formatting for `edge` onto the `stream`. The function can assum... |
|---|
| edge-count | Returns the number of edges attached to `vertex`. Compare with the more flexible `vertex-degree`. |
|---|
| edge-lessp-by-direction | Returns true if and only if edge-1 is undirected and edge-2 is directed. |
|---|
| edge-lessp-by-weight | Returns true if the weight of edge-1 is strictly less than the weight of edge-2. |
|---|
| edges | Returns a list of the edges of `thing`. |
|---|
| element | |
|---|
| ensure-valid-dot-attribute | |
|---|
| find-connected-components | Returns a list of sub-graphs of `graph` where each sub-graph is a different connected component o... |
|---|
| find-edge | Search `graph` for an edge whose vertexes match `edge`. This means that `vertex-1` of the edge in... |
|---|
| find-edge-between-vertexes | Searches `graph` for an edge that connects vertex-1 and vertex-2. [?? Ignores error-if-not-found... |
|---|
| find-edge-between-vertexes-if | Finds and returns an edge between value-or-vertex-1 and value-or-vertex-2 if one exists. Unless e... |
|---|
| find-edge-if | Returns the first edge in `thing` for which the `predicate` function returns non-nil. If the `key... |
|---|
| find-edges-if | Returns a list of edges in `thing` for which the `predicate` returns non-nil. [?? why no key func... |
|---|
| find-vertex | Search 'graph' for a vertex with element 'value'. The search is fast but inflexible because it us... |
|---|
| find-vertex-if | Returns the first vertex in `thing` for which the `predicate` function returns non-nil. If the `k... |
|---|
| find-vertexes-if | Returns a list of vertexes in `thing` for which the `predicate` returns non-nil. [?? why no key f... |
|---|
| force-undirected | Ensures that the graph is undirected (possibly by calling change-class on the edges). |
|---|
| generate-directed-free-tree | Returns a version of graph which is a directed free tree
rooted at root. |
|---|
| graph->dot | Generates a description of `graph` in DOT file format. The formatting can be altered using `graph... |
|---|
| graph->dot-external | |
|---|
| graph->dot-properties | Unless a different graph-formatter is specified, this method is called by graph->dot to output gr... |
|---|
| graph-edge-mixture-matrix | Return the `mixing-matrix` of graph based on the classifier and the edge-weight function. The mix... |
|---|
| graph-mixing-matrix | Return the `mixing-matrix` of graph based on the classifier and the edge-weight function. The mix... |
|---|
| graph-roots | Returns a list of the roots of graph. A root is defined as a vertex with no source edges (i.e., a... |
|---|
| has-children-p | In a directed graph, returns true if vertex has any edges that point from vertex to some other ve... |
|---|
| has-parent-p | In a directed graph, returns true if vertex has any edges that point from some other vertex to th... |
|---|
| in-cycle-p | Returns true if `start-vertex` is in some cycle in `graph`. This uses child-vertexes to generate ... |
|---|
| in-undirected-cycle-p | Return true if-and-only-if an undirected cycle in graph is reachable from start-vertex. |
|---|
| initialize-vertex-data | |
|---|
| iterate-children | Calls fn on every vertex that is either connected to vertex by an undirected edge or is at the ta... |
|---|
| iterate-container | |
|---|
| iterate-edges | Calls `fn` on each edge of graph or vertex. |
|---|
| iterate-neighbors | Calls fn on every vertex adjecent to vertex See also iterate-children and iterate-parents. |
|---|
| iterate-parents | Calls fn on every vertex that is either connected to vertex by an undirected edge or is at the so... |
|---|
| iterate-source-edges | In a directed graph, calls `fn` on each edge of a vertex that begins at vertex. In an undirected ... |
|---|
| iterate-target-edges | In a directed graph, calls `fn` on each edge of a vertex that ends at vertex. In an undirected gr... |
|---|
| iterate-vertexes | Calls `fn` on each of the vertexes of `thing`. |
|---|
| make-edge-container | Make-edge-container is called during graph creation and can be used to create specialized contain... |
|---|
| make-edge-for-graph | It should not usually necessary to call this in user code. Creates a new edge between vertex-1 an... |
|---|
| make-filtered-graph | Takes a GRAPH and a TEST-FN (a single argument function
returning NIL or non-NIL), and filters th... |
|---|
| make-graph | Create a new graph of type `graph-type'. Graph type can be
a symbol naming a sub-class of basic-... |
|---|
| make-graph-from-vertexes | Create a new graph given a list of vertexes (which are assumed to be from the same graph). The ne... |
|---|
| make-vertex-container | Make-vertex-container is called during graph creation and can be used to create specialized conta... |
|---|
| make-vertex-edges-container | Called during the initialization of a vertex to create the create the container used to store the... |
|---|
| make-vertex-for-graph | Creates a new vertex for graph `graph`. The keyword arguments include:
* vertex-class : specify ... |
|---|
| map-over-all-combinations-of-k-edges | |
|---|
| map-over-all-combinations-of-k-vertexes | |
|---|
| minimum-spanning-tree | Returns a minimum spanning tree of graph if one exists and nil otherwise. |
|---|
| mst-find-set | |
|---|
| mst-link | |
|---|
| mst-make-set | |
|---|
| mst-tree-union | |
|---|
| neighbor-vertexes | Returns a list of the vertexes to which `vertex` is connected by an edge disregarding edge direct... |
|---|
| number-of-neighbors | Returns the number of neighbors of `vertex` (cf. `neighbor-vertexes`). [?? could be a defun] |
|---|
| other-vertex | Assuming that the value-or-vertex corresponds to one of the vertexes for `edge`, this method retu... |
|---|
| out-edge-for-vertex-p | Returns true if the edge is connected to vertex and is either an undirected edge or a directed ed... |
|---|
| parent-vertexes | Returns a list of the vertexes to which `vertex` is connected by an edge and for which `vertex` i... |
|---|
| project-bipartite-graph | Creates the unimodal bipartite projects of existing-graph with
vertexes for each vertex of existi... |
|---|
| renumber-edges | Assign a number to each edge in a graph in some unspecified order. [?? internal] |
|---|
| renumber-vertexes | Assign a number to each vertex in a graph in some unspecified order. [?? internal] |
|---|
| replace-vertex | Replace vertex `old` in graph `graph` with vertex `new`. The edge structure of the graph is maint... |
|---|
| rootp | Returns true if `vertex` is a root vertex (i.e., it has no incoming (source) edges). |
|---|
| search-for-vertex | Search 'graph' for a vertex with element 'value'. The 'key' function is applied to each element b... |
|---|
| source-edge-count | Returns the number of source edges of vertex (cf. source-edges). [?? could be a defun] |
|---|
| source-edges | Returns a list of the source edges of `vertex`. [?? Could be a defun]. |
|---|
| source-vertex | Returns the source-vertex of a directed edge. Compare with `vertex-1`. |
|---|
| subgraph-containing | Returns a new graph that is a subset of `graph` that contains `vertex` and all of the other verte... |
|---|
| tag | |
|---|
| tag-all-edges | Sets the `tag` of all the edges of `thing` to true. [?? why does this exist?] |
|---|
| tag-edges | Sets the `tag` of all the edges of `thing` to true. [?? why does this exist?] |
|---|
| tagged-edge-p | Returns true if-and-only-if edge's tag slot is t |
|---|
| target-edge-count | Returns the number of target edges of vertex (cf. target-edges). [?? could be a defun] |
|---|
| target-edges | Returns a list of the target edges of `vertex`. [?? Could be a defun]. |
|---|
| target-vertex | Returns the target-vertex of a directed edge. Compare with `vertex-2`. |
|---|
| topological-sort | Returns a list of vertexes sorted by the depth from the roots of the graph. See also assign-level... |
|---|
| traverse-elements | WIP |
|---|
| traverse-elements-helper | WIP |
|---|
| undirected-edge-p | Returns true if-and-only-if edge is undirected |
|---|
| untag-all-edges | Sets the `tag` of all the edges of `thing` to nil. [?? why does this exist?] |
|---|
| untag-edges | Sets the `tag` of all the edges of `thing` to true. [?? why does this exist?] |
|---|
| untagged-edge-p | Returns true if-and-only-if edge's tage slot is nil |
|---|
| vertex->dot | Unless a different vertex-formatter is specified with a keyword argument, this is used by graph->... |
|---|
| vertex-count | Returns the number of vertexes in `graph`. [?? could be a defun] |
|---|
| vertexes | Returns a list of the vertexes of `thing`. |
|---|
| vertices-share-edge-p | Return true if vertex-1 and vertex-2 are connected by an edge. [?? Compare adjacentp] |
|---|
| weight | Returns the weight of an edge. This defaults to 1.0 and can only be altered if the edge is a sub-... |
|---|
| write-name-for-dot | |
|---|
