-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFFalg.py
130 lines (114 loc) · 3.91 KB
/
FFalg.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
import itertools as it
import sys
import pickle
def Magic4to3(FourToThree,request):
for i in it.permutations(request):
if str(i) in FourToThree.keys():
Result=FourToThree[str(i)]
return Result
def Magic3to4(ThreeToFour,request):
return ThreeToFour[str(request)]
class Edge(object):
def __init__(self, u, v, w):
self.source = u
self.target = v
self.capacity = w
def __repr__(self):
return "%s~%s" % (self.source, self.target)
class FlowNetwork(object):
def __init__(self):
self.adj = {}
self.flow = {}
def AddVertex(self, vertex):
#if self.adj.get(vertex)==None:
self.adj[vertex] = []
#else:
# return 5
def GetEdges(self, v):
return self.adj[v]
def AddEdge(self, u, v, w = 0):
if u == v:
raise ValueError("u == v")
edge = Edge(u, v, w)
redge = Edge(v, u, 0)
edge.redge = redge
redge.redge = edge
self.adj[u].append(edge)
self.adj[v].append(redge)
# Intialize all flows to zero
self.flow[edge] = 0
self.flow[redge] = 0
def FindPath(self, source, target, path):
if source == target:
return path
for edge in self.GetEdges(source):
residual = edge.capacity - self.flow[edge]
if residual > 0 and not (edge, residual) in path:
result = self.FindPath(edge.target, target, path + [(edge, residual)])
if result != None:
return result
def MaxFlow(self, source, target):
path = self.FindPath(source, target, [])
#print 'path after enter MaxFlow: %s' % path
#for key in self.flow:
# print '%s:%s' % (key,self.flow[key])
#print '-' * 20
while path != None:
flow = min(res for edge, res in path)
for edge, res in path:
self.flow[edge] += flow
self.flow[edge.redge] -= flow
#for key in self.flow:
# print '%s:%s' % (key,self.flow[key])
path = self.FindPath(source, target, [])
#print 'path inside of while loop: %s' % path
#for key in self.flow:
# print '%s:%s' % (key,self.flow[key])
return sum(self.flow[edge] for edge in self.GetEdges(source))
if __name__ == "__main__":
gr = FlowNetwork()
gr.AddVertex('root')
gr.AddVertex('end')
if len(sys.argv)>1:
args=[]
ThreeToFour={}
FourToThree={}
ThreeToFour = pickle.load( open( "save3t4.p", "rb" ) )
FourToThree = pickle.load( open( "save4t3.p", "rb" ) )
for i in sys.argv[1:]:
args.append(i)
#print args
req=()
if len (args) == 4:
for i in args:
req=req+(int(i),)
print req
a= Magic4to3(FourToThree,req)
print a
sys.exit(0)
if len (args) == 3:
for i in args:
req=req+(int(i),)
print req
a= Magic3to4(ThreeToFour,req)
print a
sys.exit(0)
for i in it.combinations(range(27),4):
gr.AddVertex(i)
gr.AddEdge('root',i,1)
for t in it.combinations(i,3):
for j in it.permutations(t):
gr.AddVertex(j)
gr.AddEdge(i,j,1)
gr.AddEdge(j,'end',1)
print gr.MaxFlow('root','end')
ThreeToFour={}
FourToThree={}
for i in gr.flow.keys():
if gr.flow[i]==1:
k=str(i)
four,three=k.split('~')
FourToThree[four]=three
ThreeToFour[three]=four
pickle.dump( FourToThree, open( "save4t3.p", "wb" ) )
pickle.dump( ThreeToFour, open( "save3t4.p", "wb" ) )