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] (81 (1] 2 [1] (8] (1 (8) 3 (8] (1] [8] (8] 4 [1] (0] (0] (0] Adjacency List:

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

In C++ language. Sample run should be exact as the one on image. Thanks

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)
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Adjacency Matrix
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education