Data Structure › Graph › Question #5661
MCQ Single Best Answer Easy

QWhat is the Kruskal's algorithm used for in graph theory?

ID: #5661 Graph 171 views
Question Info
#5661Q ID
EasyDifficulty
GraphTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A To find the shortest path between two nodes in a weighted graph ✔ ✖
  • B To find the longest path between two nodes in a weighted graph ✔ ✖
  • C To find the minimum spanning tree of a graph ✔ ✖
  • D To find the maximum flow in a network ✔ ✖
Correct Answer: Option C

Explanation

To find the minimum spanning tree of a graph
 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the difference between a directed and an undirected graph? What is the time complexity of Breadth First Search (BFS) on a graph with V vertices and E edges? What is a bipartite graph? What is a graph? What is a path in a graph? What is a vertex in a graph? What is Dijkstra's algorithm used for in graph theory? What is a weighted graph? What is the Floyd-Warshall algorithm used for in graph theory? What is an undirected graph?