1. Unreachable Nodes You have been given an undirected graph consisting of N nodes and Medges. The nodes in this graph are enumerated from 1 to N. The graph can consist of self-loops as well as multiple edges. This graph consists of a special node called the head node. You need to consider this and the entry point of this graph. You need to find the number of nodes that are unreachable from this head node. Create a function unreachableNodesCount(N, M, ListofEdges, HeadNode) where N is the number of nodes, M is the number of edges, List0fEdges contains list of edges in the graph and HeadNode is a special node which is the entry point of this graph. The function will return the number of nodes that are unreachable from the head node. Note: You will need to use N, M and List of Edges to first create the graph, as well as a search function to define the unreachable nodes count. >>> N - 10 >>> M - 10 >>> List0fEdges ▪ [(8, 1), (8, 3), (7, 4), (7, 5), (2, 6), (10, 7), (2, 8), (10, 9), (2, 10), (5, 10)] >>> HeadNode - 2 >>> unreachableNodesCount (N, M, ListOfEdges, HeadNode)
1. Unreachable Nodes You have been given an undirected graph consisting of N nodes and Medges. The nodes in this graph are enumerated from 1 to N. The graph can consist of self-loops as well as multiple edges. This graph consists of a special node called the head node. You need to consider this and the entry point of this graph. You need to find the number of nodes that are unreachable from this head node. Create a function unreachableNodesCount(N, M, ListofEdges, HeadNode) where N is the number of nodes, M is the number of edges, List0fEdges contains list of edges in the graph and HeadNode is a special node which is the entry point of this graph. The function will return the number of nodes that are unreachable from the head node. Note: You will need to use N, M and List of Edges to first create the graph, as well as a search function to define the unreachable nodes count. >>> N - 10 >>> M - 10 >>> List0fEdges ▪ [(8, 1), (8, 3), (7, 4), (7, 5), (2, 6), (10, 7), (2, 8), (10, 9), (2, 10), (5, 10)] >>> HeadNode - 2 >>> unreachableNodesCount (N, M, ListOfEdges, HeadNode)
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
use python
![1. Unreachable Nodes
You have been given an undirected graph consisting
of N nodes and Medges. The nodes in this graph are
enumerated from 1 to N. The graph can consist of
self-loops as well as multiple edges. This graph
consists of a special node called the head node. You
need to consider this and the entry point of this
graph. You need to find the number of nodes that
are unreachable from this head node.
Create a function unreachableNodesCount (N, M,
ListofEdges, HeadNode) where N is the number
of nodes, M is the number of edges, List0fEdges
contains list of edges in the graph and HeadNode
is a special node which is the entry point of this
graph. The function will return the number of
nodes that are unreachable from the head node.
Note: You will need to use N, M and List of Edges to
first create the graph, as well as a search function to
define the unreachable nodes count.
>>>N = 10
>>> M = 10
>>> ListofEdges
[(8, 1), (8, 3), (7,
4), (7, 5), (2, 6), (10, 7), (2, 8), (10,
9), (2, 10), (5, 10)]
>>> HeadNode = 2
>>> unreachableNodesCount (N, M,
List0fEdges, HeadNode)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8d0126f0-6be4-4a36-9c4c-265a2a7298b8%2Fd7e74fb9-6177-4edc-a3a4-67fc3d040232%2Fqam5vav_processed.png&w=3840&q=75)
Transcribed Image Text:1. Unreachable Nodes
You have been given an undirected graph consisting
of N nodes and Medges. The nodes in this graph are
enumerated from 1 to N. The graph can consist of
self-loops as well as multiple edges. This graph
consists of a special node called the head node. You
need to consider this and the entry point of this
graph. You need to find the number of nodes that
are unreachable from this head node.
Create a function unreachableNodesCount (N, M,
ListofEdges, HeadNode) where N is the number
of nodes, M is the number of edges, List0fEdges
contains list of edges in the graph and HeadNode
is a special node which is the entry point of this
graph. The function will return the number of
nodes that are unreachable from the head node.
Note: You will need to use N, M and List of Edges to
first create the graph, as well as a search function to
define the unreachable nodes count.
>>>N = 10
>>> M = 10
>>> ListofEdges
[(8, 1), (8, 3), (7,
4), (7, 5), (2, 6), (10, 7), (2, 8), (10,
9), (2, 10), (5, 10)]
>>> HeadNode = 2
>>> unreachableNodesCount (N, M,
List0fEdges, HeadNode)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
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