Expand description
§graph-core
Core graph abstractions for graph-rs: type-safe node/edge identifiers,
the central Graph trait, and two primary representations —
AdjacencyList and AdjacencyMatrix.
Structs§
- Adjacency
List - A sparse graph representation backed by an adjacency list.
- Adjacency
Matrix - A dense graph representation backed by a 2-D adjacency matrix.
- Edge
- A directed edge from
sourcetotargetcarrying a weight of typeW. - EdgeId
- A type-safe edge identifier.
- Graph
Builder - A fluent builder for constructing graphs from either representation.
- NodeId
- A type-safe node identifier.
Enums§
- Graph
Error - Errors that can arise from graph operations.
Traits§
- Graph
- The central graph abstraction that every algorithm in graph-rs operates on.
Type Aliases§
- Unweighted
Edge - An unweighted directed edge (weight type
()). - Weighted
Edge - A weighted directed edge with
f64weights.