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

Add method for topological sorting #12

Open
wants to merge 22 commits into
base: master
Choose a base branch
from

Conversation

fsobanski
Copy link

No description provided.

@fsobanski
Copy link
Author

Would you consider accepting this PR? It's basically just an implementation of this algorithm.

@kevinrutherford
Copy link
Owner

kevinrutherford commented Jan 16, 2018 via email

fsobanski added 21 commits January 16, 2018 19:25
Used Rubocop with default settings as provided by the atom ide.
See https://github.com/bbatsov/ruby-style-guide#naming
"Avoid prefixing predicate methods with the auxiliary verbs such as is, does, or can. These words are redundant and inconsistent with the style of boolean methods in the Ruby core library, such as empty? and include?."
I don't support backwards compatibility.
I don't support backwards compatibility.
See https://github.com/bbatsov/ruby-style-guide#naming
"Avoid prefixing predicate methods with the auxiliary verbs such as is,
does, or can. These words are redundant and inconsistent with the style
of boolean methods in the Ruby core library, such as empty? and include?."
Subgraph test should also cover ancestors and descendants more than one
step away.
The commit broke the travis build for some reason.

This reverts commit 5cc4d5f.
This is not a multigraph.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants