Write a C program to implement an algorithm based on Depth-First Search to test the connectivity of a given network.
Write a C program to implement an algorithm based on Depth-First Search to test the connectivity of a given network.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Implementation for this. Sample code to read inputs already give.
Transcribed Image Text:(i) Write a C program to implement an algorithm based on Depth-First Search to test the connectivity of a
given network.
Input: Adjacency matrix (refer to sample program on page 6 for reading in an adjacency matrix)
Output:
The sequence that vertices are being visited
The vertices of each connected component of a given graph
The parent of each vertex (a vertex p is the parent of vertex c if c is visited from p)
![* Include header file for printf */
* Define a constant */
#include <stdio.h>
#define maxV 100
int V, E, x, y:
int a[maxV][maxV];
int count = 0;
* Declare variables */
* Declare a two dimensional array */
* Declare and initialize variable */
void read_graph(void);
void print_graph(void);
* Function prototype /
* Main program. */
void main()
{
read_graph();
print_graph();
/* call function to input graph adjacency matrix */
/* call function to output graph adjacency matrix */
* Function to read graph adjacency matrix */
void read_graph( void )
{
int edge, x;
printf("InInput number of vertices :");
scanf("%d", &V);
if (V > maxV)
printf("Exceed the maximum number of vertices permitted");
else
{
for (x=1; x <= V; x++)
for (y=1; y <= V; y++)
a[x][y] = 0;
for (x=1; x <= V; x++)
for (y=x; y <= V; y++)
{
printf("Ina[ %d ][ %d ]=", x, y);
scanf("%d", &edge);
a[x][y] = edge;
aly][x] = edge;
}
}
void print_graph(void)
I* Function to print graph adjacency matrix
int x,y;
for (x=1; x <= V; x++)
for (y=1; y <= V; y++)
printf("a[ %d ][ %d ]= %d", x, y, a[x][y]):
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1e6a9b5e-7be7-44fa-a640-7da6aaa32842%2F1f3bf241-d22f-4a0f-ae58-fc5812f51230%2Fok3b3k_processed.png&w=3840&q=75)
Transcribed Image Text:* Include header file for printf */
* Define a constant */
#include <stdio.h>
#define maxV 100
int V, E, x, y:
int a[maxV][maxV];
int count = 0;
* Declare variables */
* Declare a two dimensional array */
* Declare and initialize variable */
void read_graph(void);
void print_graph(void);
* Function prototype /
* Main program. */
void main()
{
read_graph();
print_graph();
/* call function to input graph adjacency matrix */
/* call function to output graph adjacency matrix */
* Function to read graph adjacency matrix */
void read_graph( void )
{
int edge, x;
printf("InInput number of vertices :");
scanf("%d", &V);
if (V > maxV)
printf("Exceed the maximum number of vertices permitted");
else
{
for (x=1; x <= V; x++)
for (y=1; y <= V; y++)
a[x][y] = 0;
for (x=1; x <= V; x++)
for (y=x; y <= V; y++)
{
printf("Ina[ %d ][ %d ]=", x, y);
scanf("%d", &edge);
a[x][y] = edge;
aly][x] = edge;
}
}
void print_graph(void)
I* Function to print graph adjacency matrix
int x,y;
for (x=1; x <= V; x++)
for (y=1; y <= V; y++)
printf("a[ %d ][ %d ]= %d", x, y, a[x][y]):
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 5 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education