Name two algorithms two find minimum spanning tree?
- 1 Answers
- 1011 Views
- I also Faced
- E-Mail Answers
Answer Posted / Sachin Arya
1) Prim's Algorithm: This is a popular algorithm for finding minimum spanning trees in a connected, undirected graph. It works by incrementally adding edges to the tree until all vertices are included. 2) Kruskal's Algorithm: This is another common algorithm for finding minimum spanning trees. Unlike Prim's, it first sorts the edges based on their weights and then builds the tree by connecting non-overlapping sets.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
