Comments on: C++ programs for the implementation of Depth-first search(DFS) for a given graph

By: ersan ka

ersan ka — Sat, 19 Sep 2015 14:51:05 +0000

tree should be am i right?
——-1
–/— |— \
-2 —-4 —5
/ \ —-| ******5 to 7 is backward edge
3 6— 7
———|
———8
———|
———9

my question is how can I separate for 3 table?
table 1 should include 1, 2, 3, 6
table 2 should include 2, 4, 8, 9
table 3 should include 5

ersan ka — Sat, 19 Sep 2015 14:48:49 +0000

tree should be am i right?
1
/ | \
2 4 5
/ \ | 5 to 7 is backward edge
3 6 7
|
8
|
9

my question is how can I separate for 3 table?
table 1 should include 1, 2, 3, 6
table 2 should include 2, 4, 8, 9
table 3 should include 5

Nitin Kumar — Fri, 20 Mar 2015 10:13:52 +0000

BrenBren — Tue, 03 Feb 2015 03:10:07 +0000

i love this soo much! i love my indian *.* muwah muwah

Jonelle — Tue, 03 Feb 2015 03:08:09 +0000

this program is awesome, the english was shit

rahul manjinder — Tue, 04 Nov 2014 18:17:14 +0000

plz expalin this program every step with comments plzzzzzzz
and reply me on my e-mail.it’s a request not an order

raheel — Fri, 31 Oct 2014 08:16:50 +0000

umara it uses stack methode

amara — Sat, 14 Jun 2014 17:26:41 +0000

i can’t understand this…..

amara — Sat, 14 Jun 2014 17:25:34 +0000

explanation plz…..

sadhna — Wed, 09 Apr 2014 17:58:19 +0000

need explation thank you