Struct Dijkstra

pub struct Dijkstra<T, F>
where
    T: PrimInt,
    F: Num + Bounded + Clone + Copy + PartialOrd,
{
    pub dist: Vec<F>,
    pub adjacency_list: Vec<Vec<(usize, F)>>,
    /* private fields */
}

Dijkstra

Example:

use competitive_hpp::prelude::*;
// edge: Vec<(from, to, cost)>
let edges = vec![(0, 1, 1),(0, 2, 6),(1, 3, 2)];

//Dijkstra::new(vertex num, edges, start vertex)
let dijkstra = Dijkstra::new(4, &edges, 0);
assert_eq!(dijkstra.dist[0], 0);
assert_eq!(dijkstra.dist[1], 1);
assert_eq!(dijkstra.dist[2], 6);

Fields

dist: Vec<F>

adjacency_list: Vec<Vec<(usize, F)>>

Implementations

impl<T, F> Dijkstra<T, F>

where T: PrimInt, F: Num + Bounded + Clone + Copy + PartialOrd,

pub fn new(n: T, edges: &[(usize, usize, F)], start: usize) -> Self

Trait Implementations

impl<T, F> Clone for Dijkstra<T, F>

where T: PrimInt + Clone, F: Num + Bounded + Clone + Copy + PartialOrd + Clone,

fn clone(&self) -> Dijkstra<T, F>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T, F> Debug for Dijkstra<T, F>

where T: PrimInt + Debug, F: Num + Bounded + Clone + Copy + PartialOrd + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.