Discrete Structure - Old Questions
19. Describe Dijkstra’s algorithm for finding the shortest path in a weighted graph between two vertices with suitable example.
8 marks
|
Asked in 2073