Shortest Route
Bellman-Ford Dynamic Programming
About This Method
The Shortest Route problem finds the minimum cost path from a source node to a destination using Bellman-Ford's dynamic programming approach. The algorithm iteratively relaxes edges until no further improvements are possible.
💡 Tip: Supports decimal edge weights. Use - or ∞ for no
direct connection. Use 0 for self-loops (diagonal).