flex-algo 0.7.0

Rust commonly used data structure and algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

//! [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.
//!
//! [Graph]
//!
//! This data structure implements Graph algorithm with acyclic, bfs, dfs.
//!
//! [BinaryTree]
//! 
//! This data structure implements BinaryTree with depth, level order, left/right side view, complete tree and count nodes.
//! 
pub use self::priority_queue::PriorityQueue;
pub use self::dijkstra::Dijkstra;
pub use self::graph::Graph;
pub use self::binary_tree::BinaryTree;
pub use self::binary_search_tree::BST;

pub mod priority_queue;
pub mod dijkstra;
pub mod graph;
pub mod binary_tree;
pub mod binary_search_tree;