Skip to content

Revise description of biconnected components functionality #78

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

Open
ssk4988 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Revise description of biconnected components functionality #78

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/graphs/BiconnectedComponents.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,11 +3,11 @@
* Date: 2017-04-17
* License: CC0
* 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
* Description: Finds all 2VCCs in an undirected graph, and
* runs a callback for the edges in each (and also on bridges). In a 2VCC 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.
* i.e., not part of any cycle, but the callback is still run on it.
* Usage:
* int eid = 0; ed.resize(N);
* for each edge (a,b) {
Expand Down