Crate rs_graph

A library for basic graph data structures and algorithms.

Reexports

pub use self::graph::Digraph;

pub use self::graph::Edge;

pub use self::graph::Graph;

pub use self::graph::IndexDigraph;

pub use self::graph::IndexGraph;

pub use self::graph::IndexNetwork;

pub use self::graph::Network;

pub use self::graph::Node;

pub use self::reversedigraph::reverse;

pub use self::reversedigraph::ReverseDigraph;

pub use builder::Buildable;

pub use builder::Builder;

pub use self::attributed::Attributed;

pub use self::attributed::AttributedBuilder;

pub use self::attributed::AttributedGraph;

pub use self::attributed::AttributedNetwork;

pub use self::attributed::Attributes;

pub use self::attributed::NetworkAttributes;

pub use self::linkedlistgraph::LinkedListGraph;

pub use self::vec::NodeSlice;

pub use self::vec::NodeSliceMut;

pub use self::vec::NodeVec;

pub use self::vec::EdgeSlice;

pub use self::vec::EdgeSliceMut;

pub use self::vec::EdgeVec;

pub use self::vec::BiEdgeSlice;

pub use self::vec::BiEdgeSliceMut;

pub use self::vec::BiEdgeVec;

Modules

algorithms	General algorithms working on graphs.
attributed	Extend a graph with attributes.
bfs	Breath-first-search algorithms.
branching	Compute a maximum weight branching.
builder	Traits for constructing graphs.
classes	Graph classes Some common graph classes.
dfs	Breath-first-search algorithms.
draw	Visualizing graphs.
graph	Traits for graph data structures.
linkedlistgraph	A linked-list based graph implementation.
maxflow	Maximum Network Flow algorithms.
mst	Minimum spanning tree algorithms.
reversedigraph	Reverse the direction of the edges of a digraph.
shortestpath	Shortest path algorithms.
vec	This module provides vectors that can be indexed by nodes, edges or arcs.

Macros

biedgevec	Create a biedge vector associated with a network.
edgevec	Create an edge vector associated with a graph.
nodevec	Create a node vector associated with a graph.

Type Definitions

Net	The default graph type.