Add comments to the code and output of it
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
Add comments to the code and output of it
![First we have to create a graph with all nodes and all edges ad
weights are same using the following code:
Int main(void)
{
//Input array containing edges of the graph
//(X,Y,W)tuple represents an edge from 'x' to 'y' having weight 'w'
struct Edge edges ]=
{
{0,1,4,),(1,2,4},(2,0,4),(2,1,4)
};
int n=size of (edges)/size of (edges[0]);
struct Graph *graph3createGraph(edges,n);
return 0;
static int minsum3D100000;
static void
getMinPathSum(Dictionary<int,ArrayList>graph,bool]visited,ArrayLi
necessary,int source,int dest,int currsum)
{
if(src==dest)
{
bool flag=true%;
for each(int i in necessary)
{
if(!visited[i])
{
flag=false;
break;
}
if(flag)
minsum=Math.Min(minsum,currsum);
return;
else{
visited[src)=true;
for(auto node:graph[srcl)
{
if(!visited[node.first)
{
visited [node.first])=true;
getMinPathSum(graph, visited,
necessary,node.first,dest,currsum+node.second);
visited [node.first]=false;
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F88967ed1-25b1-47f6-afce-02cced273bf4%2F1e65fb8c-6832-46d7-8730-a20ffcd2602b%2Fztzrht_processed.jpeg&w=3840&q=75)
Transcribed Image Text:First we have to create a graph with all nodes and all edges ad
weights are same using the following code:
Int main(void)
{
//Input array containing edges of the graph
//(X,Y,W)tuple represents an edge from 'x' to 'y' having weight 'w'
struct Edge edges ]=
{
{0,1,4,),(1,2,4},(2,0,4),(2,1,4)
};
int n=size of (edges)/size of (edges[0]);
struct Graph *graph3createGraph(edges,n);
return 0;
static int minsum3D100000;
static void
getMinPathSum(Dictionary<int,ArrayList>graph,bool]visited,ArrayLi
necessary,int source,int dest,int currsum)
{
if(src==dest)
{
bool flag=true%;
for each(int i in necessary)
{
if(!visited[i])
{
flag=false;
break;
}
if(flag)
minsum=Math.Min(minsum,currsum);
return;
else{
visited[src)=true;
for(auto node:graph[srcl)
{
if(!visited[node.first)
{
visited [node.first])=true;
getMinPathSum(graph, visited,
necessary,node.first,dest,currsum+node.second);
visited [node.first]=false;
}
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 2 steps with 1 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