![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first? |
A. | gf |
B. | de |
C. | be |
D. | bg |
Answer» C. be | |
Explanation: in krsuskal’s algorithm the edges are selected and added to the spanning tree in increasing order of their weights. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet