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

Related MCQs

• What is is the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements?
• The ratio of the time taken to solve a problem on a parallel processors to the time required to solve the same problem on a single processor with p identical processing elements.
• In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION
• Which of the following is not true about comparison based sorting algorithms?
• Which of the following statements is NOT TRUE for Internal Sorting algorithms
• ______________ algorithms use auxiliary storage (such as tapes and hard disks) for sorting because the number of elements to be sorted is too large to fit into memory.
• Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
• _____ algorithms use a heuristic to guide search.
• The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.
• Best-first search (BFS) algorithms can search both graphs and trees.