Create gabows_algorithm.py #12300
Closed
Create gabows_algorithm.py #12300
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Implemented Gabow's algorithm to find all the strongly connected components in a directed graph with a time complexity of O(V+E) as mentioned in the issue TheAlgorithms#12297
algorithms-keeper
bot
added
the
require descriptive names
![algorithms-keeper[bot]](https://avatars.githubusercontent.com/in/235834?s=60&v=4){kind=small}
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| self.stack_p = [] # Stack P | ||
| self.visited = [False] * vertices | ||
| self.result = [] | ||
| def add_edge(self, u: int, v: int) -> None: |
There was a problem hiding this comment.
Please provide descriptive name for the parameter: u
Please provide descriptive name for the parameter: v
| """ | ||
| self.graph[u].append(v) | ||
|
|
||
| def _dfs(self, v: int) -> None: |
There was a problem hiding this comment.
Please provide descriptive name for the parameter: v
for more information, see https://pre-commit.ci
|
Closing require_descriptive_names PRs to prepare for Hacktoberfest |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implemented Gabow's algorithm to find all the strongly connected components in a directed graph with a time complexity of O(V+E) as mentioned in the issue #12297
Describe your change:
Checklist: