forked from adnanaziz/EPIJudge
-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph_clone.py
75 lines (57 loc) · 1.92 KB
/
graph_clone.py
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
import collections
from test_framework import generic_test
from test_framework.test_failure import TestFailure
class GraphVertex:
def __init__(self, label):
self.label = label
self.edges = []
def clone_graph(graph):
if not graph:
return None
q = collections.deque([graph])
vertex_map = {graph: GraphVertex(graph.label)}
while q:
v = q.popleft()
for e in v.edges:
# Try to copy vertex e.
if e not in vertex_map:
vertex_map[e] = GraphVertex(e.label)
q.append(e)
# Copy edge.
vertex_map[v].edges.append(vertex_map[e])
return vertex_map[graph]
def copy_labels(edges):
return [e.label for e in edges]
def check_graph(node, graph):
if node is None:
raise TestFailure('Graph was not copied')
vertex_set = set()
q = collections.deque()
q.append(node)
vertex_set.add(node)
while q:
vertex = q.popleft()
if vertex.label >= len(graph):
raise TestFailure('Invalid vertex label')
label1 = copy_labels(vertex.edges)
label2 = copy_labels(graph[vertex.label].edges)
if sorted(label1) != sorted(label2):
raise TestFailure('Edges mismatch')
for e in vertex.edges:
if e not in vertex_set:
vertex_set.add(e)
q.append(e)
def clone_graph_test(k, edges):
if k <= 0:
raise RuntimeError('Invalid k value')
graph = [GraphVertex(i) for i in range(k)]
for (fr, to) in edges:
if fr < 0 or fr >= k or to < 0 or to >= k:
raise RuntimeError('Invalid vertex index')
graph[fr].edges.append(graph[to])
result = clone_graph(graph[0])
check_graph(result, graph)
if __name__ == '__main__':
exit(
generic_test.generic_test_main("graph_clone.py", 'graph_clone.tsv',
clone_graph_test))