Spanning Tree Problem

• Input: An undirected graph G = (V,E). G is connected.

• Output: T contained in E such that

  • (V,T) is a connected graph
  • (V,T) has no cycles

Previous slide

Next slide

Back to first slide

View graphic version