πŸ“Š High Performance Computing
Q. to solve the all-pairs shortest paths problem which algorithm's is/are used
a) Floyd's algorithm
b) Dijkstra's single-source shortest paths
c) Prim's Algorithm
d) Kruskal's Algorithm
  • (A) a) and c)
  • (B) a) and b)
  • (C) b) and c)
  • (D) c) and d)
πŸ’¬ Discuss
βœ… Correct Answer: (B) a) and b)

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
1351
Total Visits
πŸ“½οΈ
1 y ago
Published
πŸŽ–οΈ
Admin
Publisher
πŸ“ˆ
85%
Success Rate