Explain shortest path algorithm with suitable illustration
Answers
Answered by
1
Shortest path can be calculated only for the weighted graphs. The edges connecting two vertices can be assigned a nonnegative real number, called the weight of the edge. A graph with such weighted edges is called a weighted graph.
Similar questions