Crate rs_graph[−][src]
A library for basic graph data structures and algorithms.
Re-exports
pub use self::graph::BiNumberedEdge; |
pub use self::graph::NumberedDigraph; |
pub use self::graph::NumberedEdge; |
pub use self::graph::NumberedGraph; |
pub use self::graph::NumberedNetwork; |
pub use self::graph::NumberedNode; |
pub use self::graph::Digraph; |
pub use self::graph::Edge; |
pub use self::graph::Graph; |
pub use self::graph::Network; |
pub use self::graph::Node; |
pub use self::graph::IndexDigraph; |
pub use self::graph::IndexGraph; |
pub use self::graph::IndexNetwork; |
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 vec::BiEdgeSlice; |
pub use vec::EdgeSlice; |
pub use vec::NodeSlice; |
pub use vec::BiEdgeVec; |
pub use vec::EdgeVec; |
pub use vec::NodeVec; |
pub use vec::IndexBiEdgeSlice; |
pub use vec::IndexEdgeSlice; |
pub use vec::IndexNodeSlice; |
pub use vec::IndexBiEdgeVec; |
pub use vec::IndexEdgeVec; |
pub use vec::IndexNodeVec; |
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 |
| edgevec |
Create an edge vector associated with a |
| idxbiedgevec |
Create a biedge vector associated with a network. |
| idxedgevec |
Create an edge vector associated with a graph. |
| idxnodevec |
Create a node vector associated with a graph. |
| nodevec |
Create a node vector associated with a |
Traits
| EdgeMap |
Trait for maps assigning values to edges of a graph. |
| EdgeMapMut |
Trait for mutable maps assigning values to edges of a graph. |
| NodeMap |
Trait for maps assigning values to nodes of a graph. |
| NodeMapMut |
Trait for mutable maps assigning values to nodes of a graph. |
Type Definitions
| Net |
The default graph type. |