Module rs_graph::traits

source ·
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:

  1. Graph: an undirected graph, edges have no defined source or sink.
  2. 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. A Digraph is also a Graph, which basically means ignoring the direction information of the edges.

Modules

  • refs
    Reference graph traits.

Structs

  • GraphIter
    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.
  • DirectedEdge
    A directed edge.
  • FiniteDigraph
    A (finite) directed graph with a known number of nodes and edges.
  • FiniteGraph
    A (finite) graph with a known number of nodes and edges.
  • Graph
    A trait for general undirected, finite graphs.
  • GraphIterator
    A graph iterator.
  • GraphType
    Base information of a graph.
  • IndexDigraph
    A Digraph that is also an IndexGraph.
  • 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.

Type Aliases