/* Write C++ programs for the implementation of BFS for a given graph */

#include<iostream> #include<conio.h> #include<stdlib.h> using namespace std; int cost[10][10],i,j,k,n,qu[10],front,rare,v,visit[10],visited[10]; main() { int m; cout <<"enterno of vertices"; cin >> n; cout <<"ente no of edges"; cin >> m; cout <<"\nEDGES \n"; for(k=1;k<=m;k++) { cin >>i>>j; cost[i][j]=1; } cout <<"enter initial vertex"; cin >>v; cout <<"Visitied vertices\n"; cout << v; visited[v]=1; k=1; while(k<n) { for(j=1;j<=n;j++) if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1) { visit[j]=1; qu[rare++]=j; } v=qu[front++]; cout<<v << " "; k++; visit[v]=0; visited[v]=1; } } |

**OUTPUT**

enterno of vertices9

ente no of edges9

EDGES

1 2

2 3

1 5

1 4

4 7

7 8

8 9

2 6

5 7

enter initial vertex1

Visited vertices

12 4 5 3 6 7 8 9

Description :

- C++ programs for the implementation of Depth-first search(DFS) for a given graph
- C++ programs to implement the Prim’s algorithm to generate a minimum cost spanning tree
- C++ programs to implement the Kruskal’s algorithm to generate a minimum cost spanning tree
- C++ program to implement circular queue ADT using an array
- C++ programs to implement Graph Traversal Techniques – Depth First Search/Breadth First Search

Email: |

8951
algorithm
array
ASM program
binary tree
C/C++
C/C++ Programms
c graphics
c interview question
class
cpp
c program
c programs
C Programs
Data structure
download
engineering questions
free
frequently asked interview questions
Graphics
HDL
interview questions and answers
it interview questions
Java
Java program
Keyboard Interface
lab programs
linked list
Linked Lists
Microcontroller
microprocessor
program
programs
questions for an interview
Queue
source code
Source Codes
stack
Stepper motor
templates
top interview questions
verilog
Verilog program
Verilog programs
vlsi

This is the one stop educational site for all Electronic and Computer students. If you want to learn something new then we are here to help. We work on Microcontroller projects, Basic Electronics, Digital electronics, Computer projects and also in basic c/c++ programs.

#Home #Sitemap #Resources #Terms of Use

Copyright©2012 electrofriends.com All Rights Reserved

Contact:info@electrofriends.com

I guess, that there must be a space between 1 and 2 in “Visited vertices

1(here should be a space?)2 4 5 3 6 7 8 9″

thanks for your simple way of implementing the program

can you plz help me in implementing DFS in c

implementation

Nic one! But how do we implement by linked list ?

Thanks 4 the program. Before this example I didn’t understand BFS. But now I have understood it. Thanks again a lot.

nice, but doesn’t work try with initial vertex 4 or 7

Impressive.. Short and understandable code… NIce.. keep it up.. and thanx..

will you try this program in this way.

input is asking the no.of vertices?

and asking the adjecency matrix?

then output comes like visited nodes.

so please try in this way.

can you explain each code?? Thanks.

nice

I think there’s one line missing maybe

maybe pop that starting vertex into the queue before you hit the while loop?

please give me bfs and dfs with queue from classes

my mail address is homatts@hotmail.com

Thanks a lot

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

salam

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

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

code is wrong it dos not work properly

i agree with mrityunjay

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

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

code is wrong…will not show the correct output…