b) One application of the depth-first search is for checking acyclicity of a graph. If there is a back edge (an edge not in the DFS tree T) from some vertex u to its ancestor v in T, the graph has a cycle that comprises the path from v to u via a sequence of tree edges in T followed by the back edge from u to v. Modify your program to determine if there is a cycle in each connected components of a given graph. Test your program with the graph given in part(a) above.

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
icon
Related questions
Question

Language : C 

(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)
Note:
To mark a vertex to indicate if has been visited or not, a one-dimensional integer array, say
visit[maxV], where maxV is the size of the array, could be used. visit[i] is set to 0 initially for all i
(unvisited), and is set to 1 if visited.
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) Note: To mark a vertex to indicate if has been visited or not, a one-dimensional integer array, say visit[maxV], where maxV is the size of the array, could be used. visit[i] is set to 0 initially for all i (unvisited), and is set to 1 if visited.
b) One application of the depth-first search is for checking acyclicity of a graph. If there is a back edge (an edge
not in the DFS tree T) from some vertex u to its ancestor v in T, the graph has a cycle that comprises the path
from v to u via a sequence of tree edges in T followed by the back edge from u to v. Modify your program to
determine if there is a cycle in each connected components of a given graph. Test your program with the
graph given in part(a) above.
Transcribed Image Text:b) One application of the depth-first search is for checking acyclicity of a graph. If there is a back edge (an edge not in the DFS tree T) from some vertex u to its ancestor v in T, the graph has a cycle that comprises the path from v to u via a sequence of tree edges in T followed by the back edge from u to v. Modify your program to determine if there is a cycle in each connected components of a given graph. Test your program with the graph given in part(a) above.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Introduction to computer system
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education