Correctness of ST Algorithm

• There are no cycles in T

  • This is an invariant of the algorithm.
  • Each edge added to T goes from a vertex in T to a vertex not in T.

• If G is connected then eventually every vertex is marked.

1

unmarked

Previous slide

Next slide

Back to first slide

View graphic version