Description

THIS CODE IS SIMPLE BUT NOT EASY TO WRITE SO PLEASE BEFORE RUNNING THE PROGRAM SEE THE CODE AND THEN RUN IF YOU DO'NT UNDERSTAND THEN SUMMIT QUERRY IN email address dwarikachandra@gmail.com

Source Code

/*TO FIND THE BFS AND DFS OF THE GIVEN GRAPH*/

#include<stdio.h>

#include<conio.h>



#define size 20



int a[10][10],vertex[10],n,e;



/*STACK FUNCTIONS*/

#define bottom -1



int stack[size],top=bo

... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.