0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
How do you write a c program for performing DFS and BFS operations?
#include<stdio.h> #include<conio.h> #include<alloc.h> #include<process.h> #include<string.h> #define MAX 20 typedef struct queue { int data; struct queue *next; }queue; typedef struct stack { int data; struct stack *next; }stack; typedef struct adj_list { int vertex; struct adj_list *next; }adj_list; adj_list *G[MAX]; int queue_empty(queue *front,queue *rear) { if(front==NULL && rear==NULL) return 1; else return 0; } queue* getnode() { queue *newnode; newnode = (queue*)malloc(sizeof(queue)); newnode->next = NULL; return newnode; } void enqueue(queue **front, queue **rear, int data) { queue *newnode; newnode = getnode(); newnode->data = data; if(queue_empty(*front,*rear)) { *front = *rear = newnode; } else { (*rear)->next = newnode; (*rear) = newnode; } } int dequeue(queue **front,queue **rear) { int data; queue *temp; if(queue_empty(*front,*rear)) return 0; temp = *front; data = (*front)->data; if(*front==*rear) { *front = *rear = NULL; } else { *front = (*front)->next; } free(temp); return data; } stack* create_node() { stack *newnode; newnode = (stack*)malloc(sizeof(stack)); newnode->next = NULL; return newnode; } void push(stack **top, int data) { stack *newnode; newnode = create_node(); newnode->data = data; newnode->next = *top; *top = newnode; } int pop(stack **top) { stack *temp; int data; temp = *top; data = (*top)->data; *top = (*top)->next; free(temp); return data; } int stack_empty(stack *top) { if(top==NULL) return 1; else return 0; } void insert(int vi, int vj) { adj_list *temp,*newnode; newnode=(adj_list*)malloc(sizeof(adj_list)); newnode->vertex = vj; newnode->next=NULL; if(G[vi]==NULL) { G[vi]=newnode; } else { temp = G[vi]; while(temp->next!=NULL) { temp = temp->next; } temp->next = newnode; } } void create(int count,char location[MAX][MAX]) { int i,edges, vi,vj; for(i=0;i<count;i++) { printf("\nEnter the name of node %d\t",i); flushall(); scanf("%s",location[i]); G[i] = NULL; } printf("\nEnter number of edges\t"); scanf("%d",&edges); for(i=0;i<edges;i++) { printf("\nEnter the edge (node u,node v)\t"); scanf("d",&vi,&vj); insert(vi,vj); insert(vi,vj); } } void BFS(int v,int count,char location[MAX][MAX]) { int w,i,visited[MAX]; queue *front=NULL,*rear=NULL; adj_list *temp; for(i=0;i<count;i++) { visited[i]=0; } enqueue(&front,&rear,v); printf("\n%s",location[v]); visited[v]=1; while(!queue_empty(front,rear)) { v = dequeue(&front,&rear); for(temp=G[v];temp!=NULL;temp=temp->next) { w = temp->vertex; if(visited[w]==0) { enqueue(&front,&rear,w); visited[w]=1; printf("\n%s",location[w]); } } } } void DFS(int v,int count,char location[MAX][MAX]) { adj_list *temp; int visited[MAX],j,w; stack *top=NULL; for(j=0;j<count;j++) { visited[j]=0; } push(&top,v); visited[v]=1; while(!stack_empty(top)) { w = pop(&top); printf("\n%s",location[w]); for(temp=G[w];temp!=NULL;temp=temp->next) { if(visited[temp->vertex]==0) { push(&top,temp->vertex); visited[temp->vertex]=1; } } } } int search(char location[MAX][MAX], char item[MAX]) { int i; for(i=0;i<MAX;i++) { if(stricmp(item,location[i])==0) /*string found*/ return i; } return -1; } void main() { int ch,count,i; char location[MAX][MAX],start[MAX]; do { clrscr(); printf("\n*** MENU ***"); printf("\n1.Create"); printf("\n2.Depth First Search"); printf("\n3.Breadth First Search"); printf("\n4.Exit"); printf("\n\nEnter your choice\t"); scanf("%d",&ch); switch(ch) { case 1: printf("\nEnter number of nodes\t"); scanf("%d",&count); create(count,location); break; case 2: printf("\nEnter starting place\t"); scanf("%s",start); i = search(location,start); if(i==-1) printf("\nInvalid Location Entered"); else { printf("\nDepth First Search...\n"); DFS(i,count,location); } break; case 3: printf("\nEnter starting place\t"); scanf("%s",start); i = search(location,start); if(i==-1) printf("\nInvalid Location Entered"); else { printf("\nBreadth First Search...\n"); BFS(i,count,location); } break; case 4:exit(0); default:printf("\nPlease enter proper choice!!!"); } getch(); }while(1); } This program performs both DFS and BFS operations.
What is the difference between SLIP and PPP?
SLIP is called Serial Line Internet Protocol and PPP is the acronym of Point-to-Point Protocol.Multi-ProtocolsPPP has some additional benefits. Unlike SLIP (which can only transport TCP/IP traffic), PPP is a multi-protocol transport mechanism. This means that PPP not only transports TCP/IP traffic, but can also transport IPX and Appletalk traffic, to name just a few. Better yet, PPP lets you transport all of these protocols at the same time - on the same connection. This is often not a concern for most users since their purpose of either using SLIP or PPP is to connect to the internet and the internet uses TCP/IP only. Therefore, there is no need to transport other protocols.Configuration NegotiationWith SLIP, you have to know the IP address assigned to you by your service provider. You also need to know the IP address of the remote system you will be dialing into. If IP addresses are dynamically assigned (depends on your service provider), your SLIP software needs to be able to pick up the IP assignments automatically failing which you have to setup them up manually. You may also need to configure such details as MTU (maximum transmission unit), MRU (maximum receive unit), use of VJ compression header (ie., CSLIP), etc. All these can get confusing pretty fast. PPP addresses this problem by negotiating configuration parameters at the start of the connection. This can greatly simplify the configuration of your PPP connection.Automatic LoginMost SLIP/PPP software can dial-up and automatically login for you. However, they often depend on your service provider's system sending out standard prompts (eg, "login:" to get the login name and "password:" to get the password). If they are any way non-standard, you either need to write a script to automate the login process yourself or login manually in the terminal emulation mode of your SLIP/PPP software. PPP provides two methods with which logins can be automated - PAP (Password Authentication Protocol) and CHAP (Challenge-Handshake Authentication Protocol). Both provide the means for your system to automatically send your login userid/password information to the remote system.
When was VJ Movement created?
VJ Movement was created in 2009.
How tall is VJ Kewl?
VJ Kewl is 169 cm.
What does vj stand for?
Vj day means victory for japan day
What is the duration of Burma VJ?
The duration of Burma VJ is 1.4 hours.
When was Chrysler VJ Valiant created?
Chrysler VJ Valiant was created in 1973.
When was Burma VJ created?
Burma VJ was created on 2008-11-12.
When was VJ Hypnotica born?
VJ Hypnotica was born on 1971-12-10.
When was VJ Andy born?
VJ Andy was born on 1980-05-31.
When was VJ Lucky born?
VJ Lucky was born on 1978-03-10.
What was the end of the pacific called?
VJ-Day (victory in japan day) its not entirely accurate
What actors and actresses appeared in VJ for a Day - 2000?
The cast of VJ for a Day - 2000 includes: Keith Collins as Himself (2001) Japhy Grant as VJ Brian McFayden as Himself - Host Raymond Munns as Himself - Host Schoen Smith as Herself - Guest VJ Bridgetta Tomarchio as VJ
What is the motto of VJ Movement?
VJ Movement's motto is 'There is more than one truth'.
