Small graph tools application
-
Greedy graph coloring test application (adapted example from the book 'Data structures and algorithms', Aho, Hopkroft, Ullman)
-
Compute shortest path between two vertices using Bellman Ford algorithm (https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
http://e-maxx.ru/algo/ford_bellman)