mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
9a44eb4479
* organized graph algorithms * all graph algorithms in Graphs/ folder * all graph algorithms are in one folder * Rename number theory/factorial_python.py to maths/factorial_python.py
33 lines
522 B
Python
33 lines
522 B
Python
from __future__ import print_function
|
|
|
|
|
|
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()
|
|
|