I have some confusions related to the application of Dijkstra and Bellman Ford algorithms.
Can Bellman Ford be used on undirected graph, or it is only for directed ones? I recognize it because most books apply them whenever I encounter a digraph.
2026-03-31 19:16:55.1774984615
Bellman Ford vs Dijkstra
60 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
See page 128 of this book. There's no reason for anyone to retype it.