For example, a graph has connectivity two or more if and only if it has no articulation points, that is, if and only if it is biconnected.
Recently Uploaded Slideshows
Depth-first search is particularly useful in finding the biconnected components of a graph.
Log in or sign up to add your own related words.
Log in or sign up to get involved in the conversation. It's quick and easy.
Wordnik is fiscally sponsored by Planetwork NGO, Inc,a California 501(c) (3) non-profit educational organization, EIN #94-3366969.