| Q. |
Which of the following edges form minimum spanning tree on the graph using kruskals algorithm? |
| A. | (b-e)(g-e)(e-f)(d-f) |
| B. | (b-e)(g-e)(e-f)(b-g)(d-f) |
| C. | (b-e)(g-e)(e-f)(d-e) |
| D. | (b-e)(g-e)(e-f)(d-f)(d-g) |
| Answer» A. (b-e)(g-e)(e-f)(d-f) | |
| Explanation: using krushkal’s algorithm on the given graph, the generated minimum spanning tree is shown below. | |
Login to Continue
It will take less than 2 minutes