The following image shows a graph with 7 vertices (nodes) labelled from 1 to 7 and edges connecting some of the vertices. 3 6 The adjacency matrix of a graph is the matrix A = (Aij) with Aj = 1 if there is an edge connecting the vertices i and j and Aij = 0 otherwise. Set up the adjacency matrix of the above graph and assign it to the variable adjacency_matrix. Represent the matrix as a list of lists such that adjacency_matrix[i-1][j-1] corresponds to Aij. Thereafter, define a function vdeg that takes an adjacency matrix (in the same format) and returns a list of the degrees of the vertices. The degree of a vertex is the number of other vertices that it is connected to. Use the function vdeg to determine the degrees of all vertices of the above graph and store the result in the variable example_degrees.

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
The following image shows a graph with 7 vertices (nodes) labelled from 1 to 7 and edges connecting some of the vertices.
3
6
1
7
The adjacency matrix of a graph is the matrix A = (Aij) with Aij = 1 if there is an edge connecting the vertices i and j and Aij = 0 otherwise.
Set up the adjacency matrix of the above graph and assign it to the variable adjacency_matrix. Represent the matrix as a list of lists such that
adjacency_matrix[i-1][j-1] corresponds to Aij.
Thereafter, define a function vdeg that takes an adjacency matrix (in the same format) and returns a list of the degrees of the vertices. The degree of a vertex is the
number of other vertices that it is connected to. Use the function vdeg to determine the degrees of all vertices of the above graph and store the result in the variable
example_degrees.
Transcribed Image Text:The following image shows a graph with 7 vertices (nodes) labelled from 1 to 7 and edges connecting some of the vertices. 3 6 1 7 The adjacency matrix of a graph is the matrix A = (Aij) with Aij = 1 if there is an edge connecting the vertices i and j and Aij = 0 otherwise. Set up the adjacency matrix of the above graph and assign it to the variable adjacency_matrix. Represent the matrix as a list of lists such that adjacency_matrix[i-1][j-1] corresponds to Aij. Thereafter, define a function vdeg that takes an adjacency matrix (in the same format) and returns a list of the degrees of the vertices. The degree of a vertex is the number of other vertices that it is connected to. Use the function vdeg to determine the degrees of all vertices of the above graph and store the result in the variable example_degrees.
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Single source shortest path
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
  • SEE MORE 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