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

Fix bipartite-color for digraphs with nodes with no outgoing edges #117

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

Conversation

prismofeverything
Copy link

An issue came up over in the Ubergraph repository about a failure with bipartite-color in the case of digraphs. There is discussion about the problem and solution there. It turns out this function comes from Loom, so I am submitting the fix here.

As it seems the code was expecting successors to perform as a general neighbors function I wonder if this assumption is being made anywhere else in the code? I know this PR adds neighbors to the core API but IMO this function is fundamental enough to justify it.

Open to all thoughts and feedback, thanks!

…ming edges, through the addition of a function
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.

1 participant