| | |
diference between breadth fisrtsearct and depth first search
![]() |
Donno exactly what you wanna know abt the 2 methods but in simplest words when applies to a tree structure with say 3 levels:
BFS: Will test all nodes on one level before moving on to the next level.
DFS: will test all child nodes of the all levels belonging to one branch before back-tracking and repeating.
Don't I can explain better than wiki:
http://en.wikipedia.org/wiki/Breadth-first_search
http://en.wikipedia.org/wiki/Depth-first_search
BFS: Will test all nodes on one level before moving on to the next level.
DFS: will test all child nodes of the all levels belonging to one branch before back-tracking and repeating.
Don't I can explain better than wiki:
http://en.wikipedia.org/wiki/Breadth-first_search
http://en.wikipedia.org/wiki/Depth-first_search
Are you Agile.. ?
![]() |
Similar Threads
- Sem (Internet Marketing Job Offers)
- "HOME SEARCH ASSISTENT" HELP!!! (Viruses, Spyware and other Nasties)
- "HOME SEARCH ASSISTENT" HELP!!! (Viruses, Spyware and other Nasties)
- Prosearching.com / Easy Search (Viruses, Spyware and other Nasties)
- homepage hijack "Search for..." about:blank in address (Viruses, Spyware and other Nasties)
- Great search homepage (HIjack log inside) (Viruses, Spyware and other Nasties)
- 2020 Search Still An Issue. (Viruses, Spyware and other Nasties)
- HELP== having some 2020 search and sear 1 problems. (Viruses, Spyware and other Nasties)
Other Threads in the C Forum
- Previous Thread: A very newb question
- Next Thread: how to detect push buttons
| Thread Tools | Search this Thread |
#include adobe ansi api array asterisks binarysearch changingto char character cm copyimagefile cprogramme creafecopyofanytypeoffileinc createcopyoffile csyntax database directory dynamic execv feet fgets file fork forloop frequency function getlasterror givemetehcodez global grade graphics gtkgcurlcompiling hacking hardware highest histogram i/o include incrementoperators infiniteloop input interest kernel keyboard kilometer license linked linkedlist linux linuxsegmentationfault list locate logical_drives looping loopinsideloop. lowest match matrix meter microsoft motherboard mqqueue mysql number odf opensource owf pattern pdf performance pointer posix probleminc process program programming radix recursion recv repetition research reversing scanf segmentationfault sequential shape socket socketprograming standard string systemcall threads turboc unix user voidmain() wab windows.h windowsapi





