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
32 lines
556 B
Python
32 lines
556 B
Python
from __future__ import print_function
|
|
|
|
|
|
class Graph:
|
|
def __init__(self, vertex):
|
|
self.vertex = vertex
|
|
self.graph = [[0] for i in range(vertex)]
|
|
|
|
def add_edge(self, u, v):
|
|
self.graph[u - 1].append(v - 1)
|
|
|
|
def show(self):
|
|
for i in range(self.vertex):
|
|
print('%d: '% (i + 1), end=' ')
|
|
for j in self.graph[i]:
|
|
print('%d-> '% (j + 1), end=' ')
|
|
print(' ')
|
|
|
|
|
|
|
|
g = Graph(100)
|
|
|
|
g.add_edge(1,3)
|
|
g.add_edge(2,3)
|
|
g.add_edge(3,4)
|
|
g.add_edge(3,5)
|
|
g.add_edge(4,5)
|
|
|
|
|
|
g.show()
|
|
|