I'm looking for an algorithm that checks that for the given directed graph its nodes can be split into two groups such that nodes don't connect to each other within their group
For example
UPD
I need to check on Bipartite graphs, that's it
Asked
Active
Viewed 495 times
1
-
1I think you're looking for a [bipartite graph](https://en.wikipedia.org/wiki/Bipartite_graph). – beaker Apr 27 '20 at 14:21
-
@beaker thanks, you're right! – vitkarpov Apr 27 '20 at 15:00
-
1Regarding your second example. What about the split {1,2} and {0,3}? – Rafał Dowgird Apr 27 '20 at 16:04
-
@RafałDowgird yeah, correct. I should've added more connections to that. – vitkarpov Apr 27 '20 at 16:07
1 Answers
0
The graph you are describing is called a Bipartite Graph.
This is a way to check if a given graph is Bipartite or not.
asds_asds
- 990
- 1
- 10
- 19