dijkstra-suite 0.1.0-beta.1

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
12
13
14
15
16
17
18
19
20
21
22

use crate::{
    graph::Graph,
    node::{NodeId, NodeWeight},
    path::Path,
    strategy::ImplementationStrategy,
};

#[derive(Debug)]
pub struct DijkstraAlgorithm {}

impl ImplementationStrategy for DijkstraAlgorithm {
    type Opts = ();

    fn run<I: NodeId, W: NodeWeight>(
        graph: &Graph<I, W>,
        from: I,
        to: I,
        options: Self::Opts,
    ) -> Result<Path<I, W>, String> {
        Ok(Path::default())
    }
}