numberlab 0.1.9

A collection of numerical 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
27
28
29
30
31
32
33
34
35
36

use numberlab::algorithm::graph::{bfs, dfs, dijkstra};
use numberlab::structure::graph::Graph;

fn main() {
    let graph = &Graph::from_adjacency_matrix_with_labels(
        ["A", "B", "C", "D", "E", "F"],
        [
            [None, Some(6), None, None, None, Some(9)],
            [None, None, Some(1), None, None, None],
            [None, None, None, None, None, Some(2)],
            [None, None, Some(4), None, None, None],
            [None, None, None, Some(2), None, None],
            [None, None, None, None, Some(8), None],
        ],
    );

    println!("{}", graph);

    println!();

    println!("DFS {:?}\nBFS {:?}\n", dfs(graph, 0, 0), bfs(graph, 0, 0));
    println!("DFS {:?}\nBFS {:?}\n", dfs(graph, 0, 1), bfs(graph, 0, 1));
    println!("DFS {:?}\nBFS {:?}\n", dfs(graph, 0, 2), bfs(graph, 0, 2));
    println!("DFS {:?}\nBFS {:?}\n", dfs(graph, 0, 3), bfs(graph, 0, 3));
    println!("DFS {:?}\nBFS {:?}\n", dfs(graph, 0, 4), bfs(graph, 0, 4));
    println!("DFS {:?}\nBFS {:?}\n", dfs(graph, 0, 5), bfs(graph, 0, 5));

    println!(
        "{:?}",
        dijkstra(graph, 0, 3)
            .iter()
            .map(|p| format!("{}({})", p.1, p.2))
            .collect::<Vec<String>>()
            .join(" --> ")
    );
}