Expand description
graphific is a graph data structure library.
Structs§
- Basic
Directed Graph - A basic implementation of a directed graph. It doesn’t allow multiple edges but allow loops.
- Basic
Undirected Graph - A basic implementation of an undirected graph. It doesn’t allow multiple edges but allow loops.
- Edge
- A structure describing an edge with an origin
Keyand destinationKey. - Vertex
- A structure describing a vertex with a
Keyand aValue.
Traits§
- Algorithms
- An interface describing all the algorithms that can be used on any kind of graphs.
- AnyGraph
- An interface used to describe any kind of graph.
- Key
- An interface used as an helper to implement a key.
- Kinship
- An interface for getting the successors and predecessors of each
Vertex. - Value
- An interface used as an helper to implement a value contained in a vertex.