[−][src]Module rs_graph::traits
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
refs |
Structs
InEdgeIter | Iterator over outgoing (directed) edges. |
IncidentEdgeIter | Iterator over incident (directed) edges. |
NeighIter | |
OutEdgeIter | Iterator over outgoing (directed) edges. |
Traits
Digraph | A trait for general directed, sized graphs. |
Directed | A graph with list access to directed incident edges. |
DirectedEdge | A directed edge. |
Graph | A trait for general undirected, sized graphs. |
GraphSize | A (finite) graph with a known number of nodes and edges. |
GraphType | Base information of a graph. |
IndexDigraph | A |
IndexGraph | Associates nodes and edges with unique ids. |
Indexable | An item that has an index. |
NumberedDigraph | Marker trait for digraphs with directly numbered nodes and edges. |
NumberedGraph | Marker trait for graphs with directly numbered nodes and edges. |
Undirected | A graph with list access to undirected incident edges. |