emmanueljohn my everyday encounter with new ideas, problems, and solutions!

Evaluating simple expression strings with the Shunting-yard algorithm

Dinic's Max Flow Algorithm

An implementation of Dinic's Maximum network flow algorithm.

Simple class for computing program runtime

Simple timer class for benchmarking your c++ program

Kruskal's algorithm

An implementation of Kruskal's minimum spanning tree algorithm.

Dial's algorithm

An Implementation of Dial’s Shortest Path Algorithm. Dijkstra’s algorithm computes the single-source shortest path problem for a weighted directed graph whose edge weights are non-negative...