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

use numberlab::algorithm::graph::{a_star, dijkstra};
use numberlab::algorithm::graph::heuristics::{
    chebyshev_heuristic, dijkstra_heuristic, euclidean_heuristic, manhattan_heuristic,
    octile_heuristic,
};
use numberlab::structure::graph::Graph;

fn main() {
    let graph = &Graph::from_adjacency_matrix([
        [None, Some(4.0), Some(1.0), None, None, None, None, None, None, None],
        [Some(4.0), None, Some(2.0), Some(1.0), None, None, None, None, None, None],
        [Some(1.0), Some(2.0), None, Some(5.0), Some(3.0), None, None, None, None, None],
        [None, Some(1.0), Some(5.0), None, Some(2.0), Some(8.0), None, None, None, None],
        [None, None, Some(3.0), Some(2.0), None, Some(6.0), Some(7.0), None, None, None],
        [None, None, None, Some(8.0), Some(6.0), None, Some(2.0), Some(3.0), None, None],
        [None, None, None, None, Some(7.0), Some(2.0), None, Some(5.0), Some(1.0), None],
        [None, None, None, None, None, Some(3.0), Some(5.0), None, Some(4.0), Some(2.0)],
        [None, None, None, None, None, None, Some(1.0), Some(4.0), None, Some(6.0)],
        [None, None, None, None, None, None, None, Some(2.0), Some(6.0), None],
    ]);

    println!("{}", graph);
    println!();
    println!("{:?}", dijkstra(graph, 0, 9));
    println!("{:?}", a_star(graph, 0, 9, dijkstra_heuristic));
    println!("{:?}", a_star(graph, 0, 9, manhattan_heuristic));
    println!("{:?}", a_star(graph, 0, 9, octile_heuristic));
    println!("{:?}", a_star(graph, 0, 9, chebyshev_heuristic));
    println!("{:?}", a_star(graph, 0, 9, euclidean_heuristic));
}