graphrs

graphrs is a Rust package for the creation, manipulation and analysis of graphs.

It allows graphs to be created with support for: * directed and undirected edges * multiple edges between two nodes * self-loops

A Graph has two generic arguments: * T: Specifies the type to use for node names. * A: Specifies the type to use for node and edge attributes. Attributes are optional extra data that are associated with a node or an edge. For example, if nodes represent people and T is an i32 of their employee ID then the node attributes might store their first and last names.

Major structs

• Graph
• Node
• Edge

Examples

Create a weighted, directed graph

``` use graphrs::{Edge, Graph, GraphSpecs, MissingNodeStrategy, Node};

let nodes = vec![ Node::fromname("n1"), Node::fromname("n2"), Node::from_name("n3"), ];

let edges = vec![ Edge::withattribute("n1", "n2", "weight", &1.0), Edge::withattribute("n2", "n1", "weight", &2.0), Edge::withattribute("n1", "n3", "weight", &3.0), Edge::withattribute("n2", "n3", "weight", &3.0), ];

let specs = GraphSpecs::directed();

let graph = Graph::<&str, &str, &f64>::newfromnodesandedges( nodes, edges, specs ); ```

Create an undirected graph from just edges

``` use graphrs::{Edge, Graph, GraphSpecs};

let mut graph: Graph<&str, ()> = Graph::new(GraphSpecs::undirectedcreatemissing()); let result = graph.add_edges(vec![ Edge::new("n1", "n2"), Edge::new("n2", "n3"), ]); ```

Create an empty graph with all possible specifications

``` use graphrs::{Graph, GraphSpecs, EdgeDedupeStrategy, MissingNodeStrategy, SelfLoopsFalseStrategy};

let graph = Graph::new( GraphSpecs { directed: true, edgededupestrategy: EdgeDedupeStrategy::Error, missingnodestrategy: MissingNodeStrategy::Error, multiedges: false, selfloops: false, selfloopsfalse_strategy: SelfLoopsFalseStrategy::Error, } ); ```

Generate a "complete" graph

use graphrs::{generators}; let graph = generators::classic::complete_graph(5, true);

Find the shortest path between two nodes

``` use graphrs::{Edge, Graph, GraphSpecs}; use graphrs::{algorithms::{shortest_path::{weighted}}};

let mut graph = Graph::<&str, ()>::new(GraphSpecs::directedcreatemissing()); graph.addedges(vec![ Edge::withweight("n1", "n2", 1.0), Edge::withweight("n2", "n1", 2.0), Edge::withweight("n1", "n3", 3.0), Edge::with_weight("n2", "n3", 1.1), ]);

let shortestpaths = weighted::singlesource(&graph, "n1", Some("n3"), None); asserteq!(shortestpaths.unwrap().get("n3").unwrap().distance, 2.1); ```