bicomponent algorithm

views updated

bicomponent algorithm A depth-first search with the addition of tests to check whether a vertex in the tree is a cut vertex, i.e. to make sure a particular path is not searched twice, which could happen if a vertex could be reached in two different ways.