Depth-First Search Dfs

Source: Internet
Author: User

Using recursion (implicitly using stacks)

Time Cost O (e+v)

input: figure G, starting point start (int)

Algorithm Process DFS (G, start)

1. Access the start node, color[start]=visited

2. Previsit (); Before the child node is accessed, the start node is processed, such as print

3. Loop, for each vertex adjacent to the start V, if Color[v]==unvisited,dfs (g,v)

4. Postvisit (); After deep access to its child nodes, the start node is processed, such as print (the processing here, can be used to sort the topology)

Depth-First Search Dfs

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.