Crate abstractgraph

This crate implements standard graph algorithms without requiring a specific graph representation.

It's quite common for graph structures to be defined implicitly by other data structures. This crate lets you run standard graph algorithms without having to translate your data structures into a specific graph representation.

Usage

To define a graph, implement the DirectedGraph trait on some data structure can be treated as agraph. You can then run the various generic graph algorithms which take a generic type implementing DirectedGraph.

History

This crate began as a port of the aga and agar modules from ccan.

Re-exports

pub use directedgraph::DirectedGraph;

pub use directedgraph::Neighbors;

pub use directedgraph::OutboundEdge;

pub use weight::EdgeWeight;

pub use weight::WeightedOutboundEdge;

Modules

algorithms	Graph algorithms implemented on abstract graphs
directedgraph	Basic definitions for directed graphs
graphs	Concrete implementations for abstract graphs
weight