flex_algo/
lib.rs

1//! [PriorityQueue]
2//!
3//! This data structure implements a Priority Queue with a comparator function to specify the Min/Max heap.
4//! The queue is implemented as a heap of indexes.
5//!
6//! [Dijkstra]
7//!
8//! This algorithm implements a Dijkstra algorithm to compute the shortest path by given graph.
9//!
10//! [Graph]
11//!
12//! This data structure implements Graph algorithm with acyclic, bfs, dfs.
13//!
14//! [BinaryTree]
15//! 
16//! This data structure implements BinaryTree with depth, level order, left/right side view, complete tree and count nodes.
17//! 
18pub use self::priority_queue::PriorityQueue;
19pub use self::dijkstra::Dijkstra;
20pub use self::graph::Graph;
21pub use self::binary_tree::BinaryTree;
22pub use self::binary_search_tree::BST;
23
24pub mod priority_queue;
25pub mod dijkstra;
26pub mod graph;
27pub mod binary_tree;
28pub mod binary_search_tree;