Write a function that takes as input the adjacency matrix of a simple graph, and decides whether the graph is bipartite or not.

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 that does exactly as it is described in the appropriate assignment.