forked from mission-peace/interview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph.py
More file actions
96 lines (70 loc) · 2.5 KB
/
graph.py
File metadata and controls
96 lines (70 loc) · 2.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#Graph class
# Java code https://github.com/mission-peace/interview/blob/master/src/com/interview/graph/Graph.java
class Graph(object):
def __init__(self, is_directed):
self.all_edges = []
self.all_vertex = {}
self.is_directed = is_directed
def add_edge(self, id1, id2, weight=0):
if id1 in self.all_vertex:
vertex1 = self.all_vertex[id1]
else:
vertex1 = Vertex(id1)
self.all_vertex[id1] = vertex1
if id2 in self.all_vertex:
vertex2 = self.all_vertex[id2]
else:
vertex2 = Vertex(id2)
self.all_vertex[id2] = vertex2
edge = Edge(vertex1, vertex2, self.is_directed, weight)
self.all_edges.append(edge)
vertex1.add_adjacent_vertex(edge, vertex2)
if self.is_directed is not True:
vertex2.add_adjacent_vertex(edge,vertex1)
class Edge(object):
def __init__(self, vertex1, vertex2, is_directed, weight):
self.vertex1 = vertex1
self.vertex2 = vertex2
self.is_directed = is_directed
self.weight = weight
def __eq__(self, other):
return self.vertex1.id == other.vertex1.id and self.vertex2.id == other.vertex2.id
def __hash(self):
return hash(vertex1) + hash(vertex2)
def __str__(self):
return "Edge " + str(self.vertex1) + " " + str(self.vertex2) + " Weight-" + str(self.weight)
def __repr__(self):
return self.__str__()
class Vertex(object):
def __init__(self, id):
self.id = id;
self.edges = []
self.adjacent_vertices = []
def add_adjacent_vertex(self, edge, vertex):
self.edges.append(edge)
self.adjacent_vertices.append(vertex)
def get_degree(self):
return len(self.edges)
def __eq__(self, other):
return self.id == other.id
def __hash__(self):
return hash(self.id)
def __str__(self):
return str("Vertex-" + str(self.id))
def __repr__(self):
return self.__str__();
def __lt__(self, other):
return self.id < other.id
def __gt__(self, other):
return self.id > other.id
if __name__ == '__main__':
g = Graph(False)
g.add_edge(1,2,10)
g.add_edge(2,3,5)
g.add_edge(1,4,6)
for edge in g.all_edges:
print(edge)
for vertex in g.all_vertex:
print("Vertex " + str(g.all_vertex[vertex]))
for edge in g.all_vertex[vertex].edges:
print("Edge " + str(edge))