Comments on: C++ programs for the implementation of Breadth First Search(BFS) for a given graph

By: Rutuja

Rutuja — Tue, 30 Jun 2015 06:00:23 +0000

plz give code for the dfs in c++

hack facebook ads — Sun, 28 Sep 2014 12:02:21 +0000

Information businesses have all the time monetized news and do
higher when it’s tailor-made to their market.

priyanka & saranya — Tue, 31 Dec 2013 10:07:23 +0000

code is wrong…will not show the correct output…

tera baap — Mon, 16 Dec 2013 13:36:13 +0000

Gandu code galat ha tera…..yaki ha yaki…….

deepu — Mon, 07 Oct 2013 12:24:40 +0000

there showing only one error at the fourth as declaration syntax can you explain it y?

sudarshan — Wed, 08 May 2013 06:54:54 +0000

code is wrong it dos not work properly
i agree with mrityunjay

Mritunjay Pandey — Fri, 01 Mar 2013 06:15:16 +0000

the code is wrong… it is showing wrong output for some of the inputs like:

no of vertices: 4
no of edges: 3

edges:
1 3
3 2
6 2

initial vertex: 3

and the output should be: 3 1 2 6
and the output of your program is: 3 2 0 0

Sun, 06 Jan 2013 17:54:34 +0000

salam
mishe baraye neveshtane tashkhis derakhte poosha ba zabane c rahnamaim konid merc

Hossam Fadeel — Fri, 21 Dec 2012 18:40:36 +0000

Thanks a lot

Did you try it in Parallel using OpenMP or other Parallel Programming?!!

hammad — Sat, 01 Sep 2012 13:13:59 +0000

please give me bfs and dfs with queue from classes
my mail address is homatts@hotmail.com