myaw's blog

DFS explanation ?
By myaw, 10 years ago, In English

If any one could explain or give me a good tutorial (c++) to understand the approach of dfs . thanks.

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (7)
| Write comment?
»
10 years ago, # |
← Rev. 2   Vote: I like it -8 Vote: I do not like it

You can go through: First:http://codeforces.net/blog/entry/16221

Second:http://codeforces.net/blog/entry/3075

→ Reply
»
10 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Good link

→ Reply
»
10 years ago, # |
  Vote: I like it -25 Vote: I do not like it

I think you are not smart enough to understand dfs. No matter how hard you try , you will not achieve it. Damn it bro!!

→ Reply
  • »
    »
    10 years ago, # ^ |
    ← Rev. 2   Vote: I like it +13 Vote: I do not like it 
    actually i think you are completely wrong!
1. Because DFS is not hard
2. every one who is safe and sound can learn this concepts
and for example you hadnt even go above 1790 in rating and you are a Candidate master
is this because you are not smart enough? and you cant ever reach above?
    → Reply
  • »
    »
    10 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    Well.. guess you are not smart enough to understand segment trees no matter how hard you try. Damn it bro.

    → Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Dfs=Depth first search. That means that dfs algorithm is an algorithm that search through nodes. For example lets imagine a tree as A->B, A->C, C->D, C->F. If we start from node A,then dfs logic follows this path: A-C-F-D-B. This logic can help us a lot when we work with objects that are connected,and much more stuffs.

I advice you for more information to check some youtube videos,to undestand the basic logic,after check some sources(dfs with recursion or stack),and finally solve as much problem you can.

→ Reply
»
10 years ago, # |
← Rev. 5   Vote: I like it +8 Vote: I do not like it

DFS is quite interesting topic. It's Dead First Search, we look for dead men first.

→ Reply