Refactored Graph#all_edges to allow for better edge indexing and searching
Added first implementation of Floyd-Warshall algorithm
Fixed array indices on FloydWarshall#run
Fixed initialization vertex indices lookup
Added input reading for Floyd-Warshall
Added initial implementation of Bellman-Ford algorithm
Fixed error when there were no in-edges and returning shortest path or false if negative cycle is found
Added input reading for Bellman-Ford
Refactored graph reading
Improved reading on graph reading
Refactored to use faster graph data structures and added cycle detection method
Removed graph library to replace it with a faster representation
Added faster graph representation
Refactored bellman-ford to use faster graph library
Refactored Floyd-Warshall to use faster graph representation
Removed debug information from Bellman-Ford
Added Djikstra skeleton
Fixed typo in Dijkstra
Added heap library
Modified heap to keep track of indices