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. ADigraph
is also aGraph
, which basically means ignoring the direction information of the edges.
Modules
- Reference graph traits.
Structs
- A graph iterator as a standard iterator.
Traits
- A trait for general directed, finite graphs.
- A graph with list access to directed incident edges.
- A directed edge.
- A (finite) directed graph with a known number of nodes and edges.
- A (finite) graph with a known number of nodes and edges.
- A trait for general undirected, finite graphs.
- A graph iterator.
- Base information of a graph.
- A
Digraph
that is also anIndexGraph
. - Associates nodes and edges with unique ids.
- An item that has an index.
- Marker trait for digraphs with directly numbered nodes and edges.
- Marker trait for graphs with directly numbered nodes and edges.
- A graph with list access to undirected incident edges.
Type Aliases
- Iterator over all edges of a graph.
- Iterator over all nodes of a graph.