Expand description
A general graph data structure library with value semantics.
by Wolf McNally
Modules§
- prelude
- Re-exports of the most commonly used items in the
wolf_graphmodule.
Macros§
- eid
- A convenience macro for creating an
EdgeIDfrom a string literal or an integer literal. - nid
- A convenience macro for creating a
NodeIDfrom a string literal or an integer literal.
Structs§
- Compound
Base - A compound graph is a graph with a parallel forest that puts the nodes of the graph into a hierarchy.
- DAG
- A DAG (Directed Acyclic Graph) data structure.
- Data
- A wrapper for binary data that is serialized as Base64.
- EdgeID
- A unique identifier for an edge in a graph.
- Elements
- A set of elment (node and edge) identifiers.
- Forest
- A forest is a graph that is a collection of trees.
- Graph
- A general graph data structure with value semantics.
- NodeID
- A unique identifier for a node in a graph.
- Reversed
Graph - An adapter that reverses the direction of edges in a graph.
- Tree
- A tree is a directed graph in which there is exactly one path between any two nodes.
Enums§
- Error
- Error type for graph operations.
Traits§
- DFSVisitor
- A visitor for depth-first search.
- Depth
First Search - A trait for a graph that supports depth-first search.
- IsTree
- A trait for a graph that supports checking whether it is a tree.
- Mutable
Compound - Mutable
Forest - Mutable
Graph - Mutable
Tree - Path
Exists - A trait for a graph that supports checking whether a path exists between two nodes.
- Topological
Sort - A trait for a graph that supports topological sort.
- Visitable
Compound - Visitable
Forest - Visitable
Graph - Visitable
Tree
Type Aliases§
- Blank
Compound - A convenience type for a compound graph with no data.
- BlankDAG
- A convenience type for a DAG with no additional data on nodes or edges.
- Blank
Forest - A convenience type for a forest with no additional data on nodes or edges.
- Blank
Graph - A convenience type for a graph with no data.
- Blank
Tree - A convenience type for a tree with no additional data on nodes or edges.
- Compound
- A compound graph is a graph with a parallel forest that puts the nodes of the graph into a hierarchy.
- Edges
- A set of edge identifiers.
- Nodes
- A set of node identifiers.