Spanning Trees
Definition: Let G=(V,E) be a connected, undirected graph. A spanning tree of G is a subgraph G’ of G containing all the vertices of G, such that G’ is a tree.
Can find a spanning tree in O(n+e). How?
Previous slide
Next slide
Back to first slide
View graphic version