graph matrix Algorithm

The adjacency matrix should be distinguished from the incidence matrix for a graph, a different matrix representation whose components indicate whether vertex – edge pairs are incident or not, and degree matrix which contains information about the degree of each vertex. In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph.
class Graph:
    def __init__(self, vertex):
        self.vertex = vertex
        self.graph = [[0] * vertex for i in range(vertex)]

    def add_edge(self, u, v):
        self.graph[u - 1][v - 1] = 1
        self.graph[v - 1][u - 1] = 1

    def show(self):

        for i in self.graph:
            for j in i:
                print(j, end=" ")
            print(" ")


g = Graph(100)

g.add_edge(1, 4)
g.add_edge(4, 2)
g.add_edge(4, 5)
g.add_edge(2, 5)
g.add_edge(5, 3)
g.show()

LANGUAGE:

DARK MODE: