Crate edgewise 

Structs

Graph

A graph is represented as an adjacency list, which is internally modelled as a vector of vectors Vec<Vec<(u32, W)>>. Each index corresponds to a node, and each inner Vec stores edges of the form (target_node, weight). The weight type W is user-defined:

Unweighted

Weighted

Enums

GraphError