----------------METU CENG315 Homework----------------

-> Homework is about finding shortest paths from two sources in a graph and
sharing the destinations among sources equally.

->Djikstra's shortest path algorithm is used as a subroutine since the graph is weighted directed graph.

->EXECUTION: use 'make' command, then './runTH'