skip to main content
Glossaries > Graph layout glossary
 
Graph layout glossary
Numerics
2-connected graph
Also known as a biconnected graph: A connected graph that will remain a connected graph if any one node is removed. (In other words, a graph in which at least two distinct paths exist between every two nodes.) A 2-connected graph has no cut-edge or cut-node.

Copyright © 2018, Rogue Wave Software, Inc. All Rights Reserved.