Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Lets say I have a graph G with its adjacency matrix A. I know that G is bipartite.
How can I split the vertices in G into the two sets that always form a bipartite graph?
Thanks!
Declare an array
whichof size equal to the number of vertices, setting each element to 0 initially. Then perform a depth-first search through the graph, recording the “level number” that you are on as you go. This starts at 1, and alternates between 1 and 2 with each edge traversed. For every vertex reached, assign the current level to the corresponding entry ofwhich, and (if it was previously 0) recurse to process its children. Afterwards, all elements ofwhichwill be either 1 or 2, andwhich[i]indicates which set vertexibelongs to.Intuitively, you can imagine that each traversal from parent to child in the DFS takes you “down” a level, and each traversal back takes you back “up”. By the bipartite property, all vertices on even levels can be connected only to vertices on odd levels and vice versa, so labelling nodes “even” or “odd” suffices to partition them into the two sets.
If your graph contains more than one component, you will of course need a separate DFS for each component.