Dijkstra's algorithm: Difference between revisions

Content added Content deleted
("directed"->"undirected")
(Undo revision 135662 by Ledrug (talk) We specifically changed it to directed earlier to make it more general (undirected is a special case))
Line 5: Line 5:


'''Task:'''
'''Task:'''
# Implement a version of Dijkstra's algorithm that computes a shortest path from a start vertex to an end vertex in an undirected graph.
# Implement a version of Dijkstra's algorithm that computes a shortest path from a start vertex to an end vertex in a directed graph.
# Run your program with the following undirected graph to find the shortest path from vertex "a" to vertex "e."
# Run your program with the following directed graph to find the shortest path from vertex "a" to vertex "e."
# Show the output of your program.
# Show the output of your program.
{| class="wikitable" style="text-align: center; float: left"
{| class="wikitable" style="text-align: center; float: left"
Retrieved from "https://rosettacode.org/wiki/Dijkstra%27s_algorithm"