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.

Sign up for GitHub

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

Jump to bottom

Bipartite algorithm does not work for undirected #6

Open
HKH515 opened this issue Sep 11, 2017 · 2 comments
Open

Bipartite algorithm does not work for undirected #6

HKH515 opened this issue Sep 11, 2017 · 2 comments

Comments

@HKH515
Copy link
Contributor

HKH515 commented Sep 11, 2017

Given an undirected algorithm with nodes 0 and 1, with an edge from 0 to 1, it works fine.
But when the edge is from 1 to 0 it says the graph is not bipartite, we tested this in GraphTea as well
and it is also occurs there.
@rostam
Copy link
Owner

rostam commented Sep 12, 2017

What is the definition of being bipartite for directed graphs?
I am not sure if there is a unique definition?

@HKH515
Copy link
Contributor Author

HKH515 commented Sep 12, 2017

Well, i have not really heard of such a definition, but the bipartite code exhibits this behaviour given a directed graph, it's not consistent, that's what I'm trying to say.

A fix would maybe be not allowing bipartite checking on a directed graph? (the reason I'm bringing this up is because we added directed/undirected support in GTea).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@rostam @HKH515