Skip to content
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 our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Greedy min vertex cover hacktoberfest #5241

Merged

Conversation

manueldilullo
Copy link
Contributor

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
  • If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

@ghost ghost added awaiting reviews This PR is ready to be reviewed tests are failing Do not merge until tests pass labels Oct 11, 2021
@ghost ghost removed the tests are failing Do not merge until tests pass label Oct 14, 2021
while queue and not queue[0][0] == 0:
# extract vertex with max rank from queue and add it to s
argmax = heapq.heappop(queue)[1][0]
S.add(argmax)
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Uppercase is reserved for constants in Python yet this line changes S so S is not a constant.

Comment on lines 24 to 26
S = set()
# queue used to store nodes and their rank
queue = []
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Move these definitions down to line 35 so that we do not define variables until we are actually ready to use them.

@ghost ghost added the tests are failing Do not merge until tests pass label Oct 14, 2021
Copy link
Member

@cclauss cclauss left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Better variable names…

heapq.heappush(queue, [-1 * len(v), (k, v)])

# s = set of chosen vertices
s = set()
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
s = set()
chosen_vertices = set()

and make similar changes elsewhere,

@ghost ghost added awaiting changes A maintainer has requested changes to this PR and removed awaiting reviews This PR is ready to be reviewed labels Oct 14, 2021
@ghost ghost added awaiting reviews This PR is ready to be reviewed and removed awaiting changes A maintainer has requested changes to this PR labels Oct 14, 2021
@manueldilullo manueldilullo requested a review from cclauss October 15, 2021 12:40
@ghost ghost removed the tests are failing Do not merge until tests pass label Oct 15, 2021
@ghost ghost removed the awaiting reviews This PR is ready to be reviewed label Oct 15, 2021
@cclauss cclauss added the hacktoberfest-accepted Accepted to be counted towards Hacktoberfest label Oct 15, 2021
@cclauss cclauss merged commit 908cb4f into TheAlgorithms:master Oct 15, 2021
@manueldilullo manueldilullo deleted the greedy_min_vertex_cover_hacktoberfest branch October 19, 2021 18:20
shermanhui pushed a commit to shermanhui/Python that referenced this pull request Oct 22, 2021
* added complete graph generator function

* added doctest, type hints, wikipedia explanation

* added return type hint for function complete_graph

* added descriptive name for the parameter: n

* random graph generator with doctest and type hints

* added Greedy min vertex algorithm

* pre-commit hook(s) made changes

* Delete complete_graph_generator.py

* Delete random_graph_generator.py

* fixed doctest

* updated commit following highligths

* fixed following pre-commit highlights

* modified variables names
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
hacktoberfest hacktoberfest-accepted Accepted to be counted towards Hacktoberfest
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants