toolbox-rs 0.6.0

A toolbox of basic data structures and algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

use toolbox_rs::{edge::InputEdge, graph::Graph, static_graph::StaticGraph};
fn main() {
    type Graph = StaticGraph<i32>;
    let edges = vec![
        InputEdge::new(0, 1, 3),
        InputEdge::new(1, 2, 3),
        InputEdge::new(4, 2, 1),
        InputEdge::new(2, 3, 6),
        InputEdge::new(0, 4, 2),
        InputEdge::new(4, 5, 2),
        InputEdge::new(5, 3, 7),
        InputEdge::new(1, 5, 2),
    ];

    let graph = Graph::new(edges);

    println!("number of nodes: {}", graph.number_of_nodes());
    println!("number of edges: {}", graph.number_of_edges());

    for i in graph.node_range() {
        println!("out_degree({})={}", i, graph.out_degree(i));
        for j in graph.begin_edges(i)..graph.end_edges(i) {
            println!(" ({},{}): {}", i, graph.target(j), graph.data(j));
        }
    }
}