Performance of ST Algorithm

• n vertices and m edges

• Connected graph

• Storage complexity O(m)

• Time complexity O(m)

Previous slide

Next slide

Back to first slide

View graphic version