Usage

To use this crate, simply add the following string to your Cargo.toml: flex-algo = "0.4.0"

Version numbers follow the semver convention.

Then use the data structure inside your Rust source code as in the following Example.

Remember that, if you need serde support, you should compile using --features serde.

Dijkstra algorithm

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

Please read the API documentation here

Example

```rust use flex_algo::Dijkstra;

fn main() { let times = vec![ (1, 2, 9), (1, 4, 2), (2, 5, 1), (4, 2, 4), (4, 5, 6), (3, 2, 3), (5, 3, 7), (3, 1, 5) ]; let dijkstra = Dijkstra::new(5, times); let (max, path) = dijkstra.shortestpath(1).unwrap(); println!("shortest path: {:?}", path); asserteq!(max, 14); } ```

PriorityQueue

This crate implements a Priority Queue with a function to change the priority of an object. Priorities are stored in a Vec and the queue is implemented as a Heap of indexes.

Please read the API documentation here

Example

```rust use flex_algo::PriorityQueue;

fn main() { // priorities let distances = [1, 6, 14, 2, 7]; // queue let mut pq = PriorityQueue::new(|a: &usize,b: &usize| distances[a] < distances[b]); asserteq!(pq.isempty(), true); pq.push(0); pq.push(1); pq.push(2); pq.push(3); pq.push(4); let value = pq.pop().unwrap(); println!("pop priority queue(closure): {:?}", value); } ```