Crate petgraph[−][src]
petgraph is a graph data structure library.

Graph
which is an adjacency list graph with arbitrary associated data. 
StableGraph
is similar toGraph
, but it keeps indices stable across removals. 
GraphMap
is an adjacency list graph which is backed by a hash table and the node identifiers are the keys into the table. 
CSR
is a sparse adjacency matrix graph with arbitrary associated data.
Optional crate feature: "serde1"
, see the Readme for more information.
Reexports
pub use graph::Graph; 
pub use Direction::Outgoing; 
pub use Direction::Incoming; 
Modules
algo 
Graph algorithms. 
csr 
Compressed Sparse Row (CSR) is a sparse adjacency matrix graph. 
data 
Graph traits for associated data and graph construction. 
dot 
Simple graphviz dot file format output. 
graph 

graphmap 

prelude 
Commonly used items. 
stable_graph 

unionfind 

visit 
Graph traits and graph traversals. 
Enums
Directed 
Marker type for a directed graph. 
Direction 
Edge direction. 
Undirected 
Marker type for an undirected graph. 
Traits
EdgeType 
A graph's edge type determines whether is has directed edges or not. 
IntoWeightedEdge 
Convert an element like 