Develop a C++ program prints the number of ways to reach the last layer of graph from the initial layer one multiplied by modulo 10° + 7. The first line of the input contains three space- separated integers: n, m and k. k lines follow. Each of them describes one of the k additional edges and contains four space-separated integers edge; (where 0 <= i <= 3). First two integers are for the initial vertex and the other two - for the terminal one. Two integers each vertex is described by are the number of the layer (edgeo and edge2 respectively) and number of the vertex in its layer (edge, and edge3 respectively). Input: 422 2150 0040 Output: 19

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...
icon
Related questions
Question
Develop a C++ program prints the number of ways to reach the last layer of graph from the
initial layer one multiplied by modulo 10° + 7. The first line of the input contains three space-
separated integers: n, m and k. k lines follow. Each of them describes one of
the k additional edges and contains four space-separated
integers edge (where 0 <= i <= 3). First two integers are for the initial vertex and the other
two - for the terminal one. Two integers each vertex is described by are the number of the
layer (edgeo and edge2 respectively) and number of the vertex in its layer
(edge, and edge3 respectively).
Input:
422
2150
0040
Output:
19
Transcribed Image Text:Develop a C++ program prints the number of ways to reach the last layer of graph from the initial layer one multiplied by modulo 10° + 7. The first line of the input contains three space- separated integers: n, m and k. k lines follow. Each of them describes one of the k additional edges and contains four space-separated integers edge (where 0 <= i <= 3). First two integers are for the initial vertex and the other two - for the terminal one. Two integers each vertex is described by are the number of the layer (edgeo and edge2 respectively) and number of the vertex in its layer (edge, and edge3 respectively). Input: 422 2150 0040 Output: 19
Expert Solution
steps

Step by step

Solved in 6 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY