Expand description
Traits for graph data structures.
The traits for graph data structures provide an additional level of information about (the edges of) the graph. There are three levels:
Graph: an undirected graph, edges have no defined source or sink.Digraph: a directed graph, each edge has a designated source and a designated sink node. Furthermore, there is the concept of “outgoing” and “incoming” edges. ADigraphis also aGraph, which basically means ignoring the direction information of the edges.
Modules§
- refs
- Reference graph traits.
Structs§
- Graph
Iter - A graph iterator as a standard iterator.
Traits§
- Digraph
- A trait for general directed, finite graphs.
- Directed
- A graph with list access to directed incident edges.
- Directed
Edge - A directed edge.
- Finite
Digraph - A (finite) directed graph with a known number of nodes and edges.
- Finite
Graph - A (finite) graph with a known number of nodes and edges.
- Graph
- A trait for general undirected, finite graphs.
- Graph
Iterator - A graph iterator.
- Graph
Type - Base information of a graph.
- Index
Digraph - A
Digraphthat is also anIndexGraph. - Index
Graph - Associates nodes and edges with unique ids.
- Indexable
- An item that has an index.
- Numbered
Digraph - Marker trait for digraphs with directly numbered nodes and edges.
- Numbered
Graph - Marker trait for graphs with directly numbered nodes and edges.
- Undirected
- A graph with list access to undirected incident edges.
Type Aliases§
- Edge
Iterator - Iterator over all edges of a graph.
- Node
Iterator - Iterator over all nodes of a graph.