Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 199 Bytes

README.md

File metadata and controls

4 lines (3 loc) · 199 Bytes

Bellman_Ford

Implementation of the bellman ford algorithm for shortest path in a weighted graph with negative weights.

Takes a command line argument pointing to the text file contaning the edges.