BF sortest path

[cmwedin]

Shortest path algo for weighted graphs with negative cycles

[cmwedin]

the application of Floyd-Warshall and Bellman-Ford are similar enough with FW having the added benefit of solving the all pairs path problem that im going to bump this out of sprints with the intention to return to it when its needed.

The situations where BF would be needed is dealing with a large graph where negative edge weights are possible.