Computer Science and Engineering › Graph › Question #5661
Single Choice Easy

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

ID: #5661 Graph 222 views
Question Info
#5661Q ID
EasyDifficulty
GraphTopic

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

Explanation

To find the minimum spanning tree of a graph
Today: 0 answered · 0 correct
Save progress
Free account

Want to remember what you got wrong?

Create a free account in seconds to track your score, revisit mistakes and continue Computer Science and Engineering where you left off.

  • Save your progress & streak
  • Topic-wise quizzes & scores
  • Bookmark tricky questions
  • Printable MCQ sets
Practice smarterFree account · save progress
Sign up free

Share This Question

Challenge a friend or share with your study group.