Ask Question

Dijkstra's algorithm finds the shortest path:

A. from one specified vertex to all the other vertices

B. from one specified vertex to another specified vertex

C. from all vertices to all other vertices that can be reached along one edge

D. from all vertices to all other vertices that can be reached along multiple edges

+5
Answers (1)
  1. 14 October, 19:44
    0
    A. from one specified vertex to all the other vertices

    Explanation:

    Dijkstra's algorithm finds the shortest path from one specified vertex to all the other vertices
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Dijkstra's algorithm finds the shortest path: A. from one specified vertex to all the other vertices B. from one specified vertex to ...” in 📗 Computers & Technology if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers