0

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.

Thong Nguyen Thanh
  • 25

1 Answers1

0

See page 128 of this book. There's no reason for anyone to retype it.

John Hughes
  • 93,729