DFS & BFS

I need programs for depth first search and breadth first search (of graph) implemented in 'C' language.
should be runable code(main(){}).
bhombalAsked:
Who is Participating?
 
snoeglerConnect With a Mentor Commented:
The concept of depth-first:

void DF_search(what)
{
  for(each child in what;;child++)
  {
    if(child->hasChilds()) search(child);
  }

  for(each child in what;;child++)
  {
    if(!child->hasChilds()) doSomething();
  }
}

Vice versa, breadth first:
void BF_search(what)
{
  for(each child in what;;child++)
  {
    if(!child->hasChilds()) doSomething();
  }

  for(each child in what;;child++)
  {
    if(child->hasChilds()) search(child);
  }
}
0
 
snoeglerCommented:
Search what? Files? B-Trees? etc.?
0
 
griesshCommented:
Dear bhombal

I think you forgot this question. I will ask Community Support to close it unless you finalize it within 7 days. You can always request to keep this question open. But remember, experts can only help you if you provide feedback to their questions.
Unless there is objection or further activity,  I will suggest to accept

     "snoegler"

comment(s) as an answer.

If you think your question was not answered at all, you can explain here why you want to do this and post a request in Community support (please include this link) to refund your points. The link to the Community Support area is: http://www.experts-exchange.com/commspt/


PLEASE DO NOT ACCEPT THIS COMMENT AS AN ANSWER!
======
Werner
0
 
MindphaserCommented:
Force accepted

** Mindphaser - Community Support Moderator **
0
All Courses

From novice to tech pro — start learning today.