Crate petgraph [−] [src]
petgraph is a graph data structure library.
The most prominent type is Graph
which is
a directed or undirected graph with arbitrary associated node and edge data.
Petgraph also provides GraphMap
which
is an undirected hashmap-backed graph which only allows simple node identifiers
(such as integers or references).
Reexports
pub use graph::Graph; |
pub use graphmap::GraphMap; |
pub use visit::{Bfs, BfsIter, Dfs, DfsIter}; |
pub use EdgeDirection::{Outgoing, Incoming}; |
Modules
algo |
Graph algorithms. |
dot |
Simple graphviz dot file format output. |
graph |
|
graphmap |
|
unionfind |
|
visit |
Graph visitor algorithms. |
Structs
Directed |
Marker type for a directed graph. |
MinScored |
|
Ptr |
A reference that is hashed and compared by its pointer value. |
Undirected |
Marker type for an undirected graph. |
Enums
EdgeDirection |
Edge direction |
Traits
EdgeType |
A graph's edge type determines whether is has directed edges or not. |
IntoWeightedEdge |
Convert an element like |