Let G=(V,E) be an undirected graph. Use depth-first search...

<< Back to: comp.lang.c Answers (Abridged) to Frequently Asked Questions (FAQ)

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

<< Back to: comp.lang.c Answers (Abridged) to Frequently Asked Questions (FAQ)

[ Home | FAQ-Related Q&As | General Q&As | Answered Questions ]

Question by jagan
Submitted on 3/13/2004
Related FAQ: comp.lang.c Answers (Abridged) to Frequently Asked Questions (FAQ)
Rating:	Rate this question:
Let G=(V,E) be an undirected graph. Use depth-first search to develop a program using 'C' language to covert each edge in G to a directed edge such that the resulting graph is strongly connected, or determine that this is not possible.

Answer by narendra
Submitted on 4/1/2004
Rating:	Rate this answer:
i want login Id for to access your site. Please send me User Id and password to on narendra_vs@hotmail.com

Answer by Gaurav
Submitted on 4/13/2004
Rating:	Rate this answer:
Let G=(V,E) be an undirected graph. Use depth-first search to develop a program using 'C' language to covert each edge in G to a directed edge such that the resulting graph is strongly connected, or determine that this is not possible.

Answer by jagan
Submitted on 9/13/2006
Rating: Not yet rated	Rate this answer:
this is not possible as there are only one node and we cannot do the search with only one node

Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer: