Implements the BellmanFord algorithm based on a given network topology to find shortest distance from source to all vertices. A global clock is maintained in order for the threads to report back to the master on completion of a round. The main method runs the master thread.
javac BellmanFordMaster.javajava BellmanFordMaster
Implements the Bread first search algorithm in an async simulated system. The async-ness is created by randomly generating time stamps for threads to send out hop values to other threads.
javac BFS.javajava BFS