Crate flex_algo

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.

Re-exports

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;

Modules

binary_search_tree

binary_tree

dijkstra

graph

priority_queue

PriorityQueue