Scribd
Upload
16 views2 pages

Bftanddft.c 0590

The document contains a C program that implements a graph using an adjacency matrix. It includes functions for initializing the graph, adding edges, and performing breadth-first and depth-first traversals. The main function demonstrates these functionalities by creating a graph and displaying the traversal results starting from vertex 1.

Uploaded by

lagova8513
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
16 views2 pages

Bftanddft.c 0590

The document contains a C program that implements a graph using an adjacency matrix. It includes functions for initializing the graph, adding edges, and performing breadth-first and depth-first traversals. The main function demonstrates these functionalities by creating a graph and displaying the traversal results starting from vertex 1.

Uploaded by

lagova8513
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include<stdio.

h>
#include<stdlib.h>
#include<stdbool.h>
#define MAX_VERTICES 100
int adjMatrix[MAX_VERTICES][MAX_VERTICES];
int numVertices;
void initializeGraph();
void addEdge(int u,int v);
void breadthFirstTraversal(int start);
void depthFirstTraversal(int start,bool visited[]);
void initializeGraph(){
numVertices=0;
for(int i=0;i<MAX_VERTICES;i++){
for(int j=0;j<MAX_VERTICES;j++){
adjMatrix[i][j]=0;
}
}
}
void addEdge(int u,int v){
adjMatrix[u][v]=1;
adjMatrix[v][u]=1;
if(u>numVertices)
numVertices=u;
if(v>numVertices)
numVertices=v;
}
void breadthFirstTraversal(int start)
{
bool visited[MAX_VERTICES]={false};
int queue[MAX_VERTICES];
int front=0,rear=0;
visited[start]=true;
queue[rear++]=start;
while(front<rear){
int current=queue[front++];
printf("%d ",current);
for(int i=1;i<=numVertices;i++){
if(adjMatrix[current][i]&&!visited[i]){
visited[i]=true;
queue[rear++]=i;
} }
}
printf("\n");
}
void depthFirstTraversal(int start,bool visited[]){
visited[start]=true;
printf("%d ",start);
for(int i=1;i<=numVertices;i++){
if(adjMatrix[start][i]&&!visited[i]){
depthFirstTraversal(i,visited);
}
}
}
int main(){
initializeGraph();
addEdge(1,2);
addEdge(1,3);
addEdge(2,4);
addEdge(2,5);
addEdge(3,6);
addEdge(3,7);
addEdge(4,8);
addEdge(5,8);
addEdge(6,8);
addEdge(7,8);
printf("Breadth-First Traversal(BFT)starting from vertex1: ");
breadthFirstTraversal(1);
bool visited[MAX_VERTICES]={false};
printf("Depth-FirstTraversal(DFT)starting from vertex1: ");
depthFirstTraversal(1,visited);
printf("\n");
return 0;
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy