Computer scienceFundamentalsEssentialsProgramming conceptsIntro to programming

External information resources

What does the algorithm do?

Report a typo

It is sometimes necessary to search for new algorithms to implement in your programs. Let's find out what Dijkstra’s shortest path algorithm does. Use external resources to find the answer.

Dijkstra’s shortest path algorithm is used to

Select one option from the list

find the shortest path from a single source vertex to all other vertices in the given graph

shorten a path from a single source vertex to all other vertices in the given graph

find the longest path from a single source vertex to another one in the given graph

delete the shortest path from a single source vertex to the next one in the given graph

___

Create a free account to access the full topic