Multiple Choice
The shortest path algorithm was developed by ____.
A) Euler
B) Kruskal
C) Prim
D) Dijkstra
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q3: A(n) _ tree T is a simple
Q4: Let G be an undirected graph.Let u
Q5: Two well-known algorithms, Prim's algorithm and _'s
Q6: The _ of sets A and B
Q7: In a(n) _ graph, the edges are
Q9: The shortest path algorithm is also called
Q10: A graph is called a(n) _ graph
Q11: Let G be a weighted graph.Let u
Q12: In a directed graph, the pairs (u,v)
Q13: _ algorithm builds the tree iteratively by