Question

-8. Which algorithm turns out that one can find the shortest paths from a given source to all points in a graph
in the same time.
O A. Kruskal's algorithm
O B. Prim's algorithm
O C. Dijkstra algorithm
O D. Bellman ford
algorithm​

Answer 1

Answer:

D . bellman ford it may help you please mark me as beainlist

Explanation:

please find the boy name Mahendra when you get please massage me

Answer 2

Answer:

C. Dijkstra algorithm can find the shortest paths from a given source to all points in a graph.

Explanation:

• Dijkstra algorithm solves the problem of finding the shortest path from a point in a graph, i.e., the source to a destination.
• It turns out that one can find the shortest path from a given source to all points in a graph at the same time.
• Hence, it is sometimes also called the single-source shortest path problem.

Explanation for incorrect options:

A. Kruskal's algorithm

• Kruskal's algorithm is used in the graph theory of discrete mathematics.
• It gives the shortest path between two points in a connected graph.

B. Prim's algorithm

• It finds a minimum spanning tree for an undirected graph.
• It is also called Jarnik's algorithm.

D. Bellman ford algorithm​

• It is used to find the shortest distance from a single vertex to other vertices.

#SPJ2