dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

use crate::priority_queue::{
    MinimumQueue,
    Pop,
    Push,
};

pub trait DijkstraSparseQueue:
    MinimumQueue + Push<T = (u64, usize)> + Pop<T = (u64, usize)> + Default
{
}

impl<Q> DijkstraSparseQueue for Q where
    Q: MinimumQueue + Push<T = (u64, usize)> + Pop<T = (u64, usize)> + Default
{
}