How many minimum spanning trees does the following graph have? Draw them.…

PYQ GATE 1995

How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to the edge).

Graph with vertices A, B, C, D, E and weighted edges AB 2, AE 3, BC 3, BD 4, CD 4, DE 5.

Attempted by 1 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…