1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Edge { int vertexl; Int vertex2; }; Implement the following functions. a. void insertEdge (Edge e, int adjMat [4] [4]); a. //Purpose: Store an edge defined by two vertices. b. void printGraph (int adjMat[4][4]) a. //prints the edges included in an adjacency matrix c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}.
1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Edge { int vertexl; Int vertex2; }; Implement the following functions. a. void insertEdge (Edge e, int adjMat [4] [4]); a. //Purpose: Store an edge defined by two vertices. b. void printGraph (int adjMat[4][4]) a. //prints the edges included in an adjacency matrix c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}.
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
Please help with C++ graph question in C++ language. Output also in image. Thank you.
![1. Write a program that implements an adjacency matrix for an undirected and unweighted
graph.
struct Edge
{ int vertexl;
Int vertex2;
} ;
Implement the following functions.
a. void insertEdge (Edge e, int adjMat[4] [4]);
a. //Purpose: Store an edge defined by two vertices.
b. void printGraph (int adjMat[4] [4])
a. //prints the edges included in an adjacency matrix
c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2),
(1,4), (2,1), (2,3), (3,2), (4,1)}.
2. Write a program that implements an adjacency matrix for an undirected and unweighted graph.
struct Node
( int Vertex;
Node* next;
};
Implement the following functions.
a. void printList (Node adjList[4])
b. //prints the vertices included in //an adjacency list
c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2),
(1,4), (2,1), (2,3), (3,2), (4,1)}.
Sample Run:
Adjacency Matrix:
1 2 3 4
1 (0] (1] (0] (1)]
2 [11 (8] (1] (8]
3 [8] [1] [0J (0]
4 [1] (0] (0] (0]
Adjacency List:
(1, 2) (1, 4> (2, 1) (2, 3) (3, 2> (4, 1)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F620c60a1-10fe-416e-8b85-1e75a34b227e%2F066c6812-2ede-4d65-8fd3-b594e2868017%2Fhqzfcm_processed.png&w=3840&q=75)
Transcribed Image Text:1. Write a program that implements an adjacency matrix for an undirected and unweighted
graph.
struct Edge
{ int vertexl;
Int vertex2;
} ;
Implement the following functions.
a. void insertEdge (Edge e, int adjMat[4] [4]);
a. //Purpose: Store an edge defined by two vertices.
b. void printGraph (int adjMat[4] [4])
a. //prints the edges included in an adjacency matrix
c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2),
(1,4), (2,1), (2,3), (3,2), (4,1)}.
2. Write a program that implements an adjacency matrix for an undirected and unweighted graph.
struct Node
( int Vertex;
Node* next;
};
Implement the following functions.
a. void printList (Node adjList[4])
b. //prints the vertices included in //an adjacency list
c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2),
(1,4), (2,1), (2,3), (3,2), (4,1)}.
Sample Run:
Adjacency Matrix:
1 2 3 4
1 (0] (1] (0] (1)]
2 [11 (8] (1] (8]
3 [8] [1] [0J (0]
4 [1] (0] (0] (0]
Adjacency List:
(1, 2) (1, 4> (2, 1) (2, 3) (3, 2> (4, 1)
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 3 steps with 3 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