Home/Questions/Q 803901
Next
In Process

Quearn Latest Questions

VARISHA PARVEZ
  • 2
VARISHA PARVEZ
Asked: May 27, 20232023-05-27T09:48:44+00:00 2023-05-27T09:48:44+00:00In:

Which of the following is a greedy algorithm used for finding the minimum spanning tree in a graph? a) Dijkstra's algorithm b) Bellman-Ford algorithm c) Kruskal's algorithm d) Floyd-Warshall algorithm

  • 2
Which of the following is a greedy algorithm used for finding the minimum spanning tree in a graph? a) Dijkstra's algorithm b) Bellman-Ford algorithm c) Kruskal's algorithm d) Floyd-Warshall algorithm
algorithmitlanguage
Share

    3 Answers

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

      Answer: c) Kruskal’s algorithm

      • 0
    3. Mohan
      Mohan
      2023-05-27T12:41:05+00:00Added an answer on May 27, 2023 at 12:41 pm

      Consumer interest

      • 0
    4. Mohan
      Mohan
      2023-05-27T12:41:27+00:00Added an answer on May 27, 2023 at 12:41 pm

      Consumer behavior

      • 0

    You must login to add an answer.

    Need An Account,

    Related Questions