Crate flex_algo

source ·
Expand description

PriorityQueue

This data structure implements a Priority Queue with a comparator function to specify the Min/Max heap. The queue is implemented as a heap of indexes.

Dijkstra

This algorithm implements a Dijkstra algorithm to compute the shortest path by given graph.

Re-exports

pub use self::priority_queue::PriorityQueue;
pub use self::dijkstra::Dijkstra;

Modules

dijkstra
priority_queue
PriorityQueue