Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork1.9k
docs: fix bridge count wording to "one or more" in bridge-searching-online.md#1485
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.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Uh oh!
There was an error while loading.Please reload this page.
Conversation
…nline.mdThe original text stated that the number of bridges decreases by “two or more,” which is incorrect in some cases. For example, in this graph:1-2-3-13-44-5-6-4There is one bridge (3–4). Adding an edge between 1 and 4 removes only that single bridge.This change updates the text to say “one or more,” which is accurate in all cases.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Pull Request Overview
This PR fixes a technical inaccuracy in the documentation for bridge-searching algorithms. The documentation incorrectly stated that adding an edge to a graph decreases the number of bridges by "two or more," when it can actually decrease by just one bridge in certain cases.
- Corrects the minimum number of bridges that can be removed when adding an edge from "two or more" to "one or more"
Tip: Customize your code reviews with copilot-instructions.md.Create the file orlearn how to get started.
2eed507 intocp-algorithms:mainUh oh!
There was an error while loading.Please reload this page.
The original text stated that the number of bridges decreases by “two or more,” which is incorrect in some cases.
For example, in this graph:
1-2-3-1
3-4
4-5-6-4
There is one bridge (3–4). Adding an edge between 1 and 4 removes only that single bridge.
This change updates the text to say “one or more,” which is accurate in all cases.