Le 72 - Shortest Paths in Weighted Graphs

Transcript

So now, let us look at a new type  of graph called a weighted graph. So, remember that in a graph like this we  have seen that a systematic way to explore this graph is breadth first search and breadth  first search explores this graph level by level and therefore because it does it level by  level, it discovers the vertices reachable from the star... Read More