Write a complete C++ program that implements the Breadth First Search (BES) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctiy working. You need to present 3 samples. Due date is during the eleventh week on Thursday 16/04/2020, 12:00 pm. You will need to turn-in your code source file submitted via the iLearn submission wizard below. Please use a cover page that includes your name, section number, university ID and Email address. Please make sure that you submit 2 different files, 1.CRp for the code and the other.doc for the word document and name them as follows "FNAME LNAME ID" Notes: - You must ask the user to enter the number of vertices n for your graph, and select the source vertex or node. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. - Assume you have an undirected graph. Description and Requirements: Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Make sure to ask the user to select the source node. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS Tree in a form of printed table similar to what we did in the class. In other words, for every node you show its color, parent, and distance from the source.
Write a complete C++ program that implements the Breadth First Search (BES) Algorithm (Chapter 22). Your final submitted code and report should include some sample results that demonstrate that your code is successfully and correctiy working. You need to present 3 samples. Due date is during the eleventh week on Thursday 16/04/2020, 12:00 pm. You will need to turn-in your code source file submitted via the iLearn submission wizard below. Please use a cover page that includes your name, section number, university ID and Email address. Please make sure that you submit 2 different files, 1.CRp for the code and the other.doc for the word document and name them as follows "FNAME LNAME ID" Notes: - You must ask the user to enter the number of vertices n for your graph, and select the source vertex or node. - Based on the number of vertices, randomly generate the edges. - Assume you are using the Adjacency Matrix to represent your graph. - Assume you have an undirected graph. Description and Requirements: Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted. Make sure to ask the user to select the source node. Use numeric numbers to name the vertices. Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or undirected graph. Apply the BFS algorithm on the generated graph. Organize the resulted BFS Tree in a form of printed table similar to what we did in the class. In other words, for every node you show its color, parent, and distance from the source.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Write a complete C++ program that implements the Breadth First Search (BFS) Algorithm (Chapter 22). Your final submitted code and report should include
some sample results that demonstrate that your code is successfully and correctly working. You need to present 3 samples.
Due date is during the eleventh week on Thursday 16/04/2020, 12:00 pm.
You will need to turn-in your code source file submitted via the iLearn submission wizard below. Please use a cover page that includes your name, section
number, university ID and Email address. Please make sure that you submit 2 different files, 1.cRp for the code and the other .doc for the word
document and name them as follows "FNAME LNAME ID"
Notes:
- You must ask the user to enter the number of vertices n for your graph, and select the source vertex or node.
- Based on the number of vertices, randomly generate the edges.
- Assume you are using the Adjacency Matrix to represent your graph.
- Assume you have an undirected graph.
Description and Requirements:
Make sure that you ask the user to enter the number of vertices, Fixed number of vertices is not accepted.
Make sure to ask the user to select the source node. Use numeric numbers to name the vertices.
Based on the number of vertices entered by the user, randomly generate the edges connected the vertices. Assume that you only allow undirected edges or
undirected graph.
Apply the BFS algorithm on the generated graph.
Organize the resulted BFS Tree in a form of printed table similar to what we did in the class. In other words, for every node you show its color, parent, and distance
from the source.
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
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY