Home/Questions/Q 803891
Next
In Process

Quearn Latest Questions

VARISHA PARVEZ
  • 1
VARISHA PARVEZ
Asked: May 27, 20232023-05-27T09:37:26+00:00 2023-05-27T09:37:26+00:00In:

Which of the following algorithms is used to find the shortest path in a weighted graph? a) Dijkstra's algorithm b) Breadth-First Search (BFS) c) Depth-First Search (DFS) d) Kruskal's algorithm

  • 1
Which of the following algorithms is used to find the shortest path in a weighted graph? a) Dijkstra's algorithm b) Breadth-First Search (BFS) c) Depth-First Search (DFS) d) Kruskal's algorithm
algorithmitlanguage
Share

    1 Answer

    1. VARISHA PARVEZ
      VARISHA PARVEZ
      2023-05-27T09:38:07+00:00Added an answer on May 27, 2023 at 9:38 am

      Answer: a) Dijkstra’s algorithm

      • 0

    You must login to add an answer.

    Need An Account,

    Related Questions