Graphs are provided in the input as adjacency matrix. Implement the BFS algorithm in C++ to print the vertices in the BFS order. When there are more than one neighbor, use alphabetical order.
Graphs are provided in the input as adjacency matrix. Implement the BFS algorithm in C++ to print the vertices in the BFS order. When there are more than one neighbor, use alphabetical order.
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
Graphs are provided in the input as adjacency matrix. Implement the BFS

Transcribed Image Text:Input Format
The first line of input is number of vertices: N
The second line is the set of vertices, i.e. vertex names.
The next N rows are for the NxN adjacency matrix.
Example:
4
A B C D
0 1 1 0
1 0 0 1
1 0 0 1
0 1 1 0
Constraints
N is greater than 0 and less than 20. Vertex names are single characters.

Transcribed Image Text:Output Format
Name of the vertices are printed in the BFS order, starting from the first vertex on the second line of the input.
Example: for the above input example
A B C D
Sample Input 0
4
A B C D
0 1 1 0
1 0 0 1
1 0 0 1
0 1 1 0
Sample Output 0
A B C D
Sample Input 1
3
A B C
0 0 1
0 0 1
1 1 0
Sample Output 1
AC B
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 1 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