Skip to content

Clarify biconnected components description #303

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
simonlindholm merged 1 commit into from
Nov 6, 2025
Merged

Clarify biconnected components description #303

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions content/graph/BiconnectedComponents.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,9 @@
* Source: folklore
* Description: Finds all biconnected components in an undirected graph, and
* runs a callback for the edges in each. In a biconnected component there
* are at least two distinct paths between any two nodes. Note that a node can
* be in several components. An edge which is not in a component is a bridge,
* i.e., not part of any cycle.
* are at least two internally disjoint paths between any two nodes (a cycle
* exists through them). Note that a node can be in several components. An
* edge which is not in a component is a bridge, i.e., not part of any cycle.
* Usage:
* int eid = 0; ed.resize(N);
* for each edge (a,b) {
Expand Down