Shulou(Shulou.com)06/01 Report--

This article mainly introduces "how to understand Java graph traversal". In daily operation, I believe many people have doubts about how to understand Java graph traversal. Xiaobian consulted various materials and sorted out simple and easy operation methods. I hope to help you answer the doubts of "how to understand Java graph traversal"! Next, please follow the small series to learn together!

Traversing a graph is the same as traversing a tree, starting from one point in the graph and traversing the rest of the vertices in the graph so that each vertex is visited only once.

depth first search DFS depth-first traversal depth-first search similar to Tree precedence traversal

The specific algorithm is expressed as follows:

Visit initial node v and mark node v as visited.

Find the first adjacent node w of node v.

If w exists, proceed to 4, otherwise the algorithm ends.

If w has not been visited, then we recursively traverse w first (i.e., we treat w as another v, and then we go to step 123).

Find the next neighbor node to the w neighbor node of node v and go to step 3.

For example, in the following figure, the depth priority traversal order is 1->2->4->8->5->3->6->7

bool visited[MAX];//initialize all false adjacency matrix deep optimization recursion because edge 1 exists//recursion DFS void (MGraph G, int i)//traverse from ith { visited[i] = true; cout

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.