A matching algorithms based on the depth first search for the general graph
Chengcheng Yu, Zhonge Sheng · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2014
In this paper, a matching algorithm of general graph based on depth-first traversal is proposed.The algorithm does not need to shrink and expand treatment when a flower is searched.This algorithm's time complexity of search an augmenting path is equal to corresponding graph's depth-first traversal algorithm's time complexity, it is one of the most efficient algorithm.Experiments show that this algorithm can correctly handle the associated practical problems, and have the correct conclusion.