Depth-First Search and Research of Algorithms Related to Bipartite Graphs
Jiayi Wang · Applied and Computational Engineering · 2024
The application of bipartite graph is extensively used in many fields of daily production and life. This in turn led to a lot of research and thinking about the bipartite graph: what is a bipartite graph? How to tell if a graph is a bipartite graph? And related algorithms for some specific characteristics of a bipartite graph. This paper uses the literature research method and the experiment method, starting from the depth-first-search, particularly summarizes and clearly explains the related algorithms of the bipartite graph: the judgment of the bipartite graph, and the calculation of its maximum matching number. Lays a foundation for solving more problems that require the application of bipartite graphs.