Kruskals algorithm Video Lecture - Algorithms - Computer Science Engineering

FAQs on Kruskals algorithm

1. What is Kruskal's algorithm used for?
Ans. Kruskal's algorithm is used to find the minimum spanning tree of a connected, edge-weighted graph.
2. How does Kruskal's algorithm work?
Ans. Kruskal's algorithm works by sorting the edges of the graph by their weights, then adding the edges in increasing order of weight while ensuring that no cycle is formed.
3. What is the time complexity of Kruskal's algorithm?
Ans. The time complexity of Kruskal's algorithm is O(E log E), where E is the number of edges in the graph.
4. When should Kruskal's algorithm be preferred over Prim's algorithm?
Ans. Kruskal's algorithm is preferred when the graph is sparse (has fewer edges) as it has a better time complexity than Prim's algorithm in such cases.
5. Can Kruskal's algorithm handle disconnected graphs?
Ans. Yes, Kruskal's algorithm can handle disconnected graphs by considering each connected component separately and finding the minimum spanning tree for each component.
Explore Courses for Computer Science Engineering (CSE) exam
Related Searches
Viva Questions, practice quizzes, past year papers, Exam, Kruskals algorithm, Kruskals algorithm, Important questions, Objective type Questions, Free, Kruskals algorithm, shortcuts and tricks, MCQs, Sample Paper, Semester Notes, pdf , video lectures, study material, Previous Year Questions with Solutions, ppt, Summary, Extra Questions, mock tests for examination;