Finding λ Edge-connected Subgraph of a Traversal Search Algorithms
Liming Song · Science Technology and Engineering · 2009
Looking for graph λ-edge-connected subgraph of the time,can make use of depth-first search algorithm,but need to go through λ traversal times to complete the search process. According to graph adjacency matrix storage structure features,a new search algorithm is given. A search process can traverse through to get λ edge-connected subgraph. Compare depth-first search algorithm,new algorithm structure is simple and easy implementation,greatly improve the efficiency of the algorithm. This search algorithm can also be used to determine the graph connectivity.