MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / BellmanFord

Function BellmanFord

dynamic_programming/bellman_ford.cpp:53–93  ·  view source on GitHub ↗

The main function that finds the shortest path from given source to all other vertices using Bellman-Ford.It also detects negative weight cycle

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

mainFunction · 0.85

Calls 1

printFunction · 0.70

Tested by

no test coverage detected