Overview

bicomponent algorithm


Show Summary Details

Quick Reference

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.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.