Graphs
Check bipartiteness of a graph digallin=1
Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not.
You can use the function Findedge_list( ) and Find_BFS_forest( ) provided by me that does exactly as it is described in the appropriate assignment.
Instructions:
If the graph is not bipartite, the output should be an array containing the nodes of an odd-length cycle in order of visiting.
If the graph is bipartite, the output should be a 1 on array with only 0 and 1 entries, where the 0 entries correspond to nodes in one part and the 1 entries correspond to nodes in the other part.
Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not.
