dijkstra-suite 0.1.0-beta.3

A Dijkstra's algorithm implementation that aims to be simple to use and fast to run
Documentation 
1
2
3
4
5
6
7
8
9
10
11

use dijkstra_suite::{dijkstra_path, graph::Graph};

extern crate dijkstra_suite;

fn main() {
    let graph: Graph<String, i32> = Graph::default();
    let start = "A".to_string();
    let end = "B".to_string();

    let _shortest_path = dijkstra_path(&graph, start, end);
}