given a not oriented graph G, find an algorithm that verify if is possible to partition the set of nodes into two sets V1 C V and V2 C V (continue)

Asked Sep 15 '21 at 16:55

Active Sep 15 '21 at 16:55

Viewed 20 times

given a not oriented graph G=(V,E) represented with adjacency list,find an algorithm(that solve the problem in linear time) that verify if is possible to partition the set of nodes into two sets V1 C V and V2 C V with this condition:

V1 U V2 = V
V1 intersected V2= void set
v belong to V1 <=> for each edge (v,w) in E , w belongs to V2

the algorithm return V1 and V2 if there is a solution

asked Sep 15 '21 at 16:55

mario

1

Is this https://www.geeksforgeeks.org/bipartite-graph/ helpful? – Peter de Rivaz Sep 15 '21 at 20:12
yes it help, thanks! – mario Sep 16 '21 at 04:57

given a not oriented graph G, find an algorithm that verify if is possible to partition the set of nodes into two sets V1 C V and V2 C V (continue)

0 Answers0