Algorithm of Bipartite Graph Decision Based on Adjacency Matrix

Bipartite graph is an important graph in modern graph theory.However,there are few sufficient algorithms to decide the bipartite graph.According the definition of bipartite graph,a new decision algorithm based on adjacency matrix is introduced,which adds inner vertex between two vertexes to test length of path,we measure many data and the performance of experiment shows that the new algorithm solves the problem of bipartite graph decision successfully.