Python网络流

题目：1 Load balanceYou have some different computers and jobs. For each job, it can only bedone on one of two specified computers. The load of a computer is thenumber of jobs which have been done on the computer. Give the numberof jobs and two computer ID for each job. You task is to minimize the maxload.(hint: binary search)

用Python实现，problem1.data

#There are multiple data sets.
#For each data set, the first line has two number N and M, which means the number of jobs and the number of computers.
#Next N line, each line for a job, has two number which means the two computers. 
4 2
1 2
1 2
1 2
1 2

7 49
31 49
42 21
31 37
2 44
28 10
43 7
8 48

27 29
24 8
24 6
23 29
1 11
26 26
2 3
21 6
21 10
18 9
29 4
8 14
4 21
5 20
12 29
22 11
14 28
19 15
21 15
17 12
21 16
25 22
4 22
28 14
5 20
17 5
11 18
10 23

35 13
2 6
6 12
6 9
12 1
4 13
3 2
6 8
4 11
11 12
5 10
4 1
2 13
13 9
11 5
3 9
6 5
6 6
5 3
12 8
2 9
6 8
11 2
12 5
4 6
4 2
10 10
7 10
2 6
9 12
5 5
13 7
11 10
10 12
11 1
7 2

16 90
51 50
36 17
63 29
16 40
85 84
80 51
56 7
64 57
84 81
19 65
61 75
17 35
27 25
44 19
65 71
81 10

23 47
7 1
26 38
4 18
47 20
43 25
34 22
11 17
35 35
35 21
39 45
17 15
31 15
39 27
27 5
12 47
27 12
30 23
19 7
34 14
47 35
5 38
28 23
8 3

74 31
29 12
27 25
12 28
29 13
18 29
23 13
30 25
16 31
17 20
14 14
27 13
25 18
10 7
21 7
17 19
30 14
21 29
8 28
3 5
11 22
20 5
28 6
4 5
23 10
16 9
11 19
30 17
15 10
13 21
26 3
16 19
2 3
27 19
16 25
25 30
19 19
2 23
12 26
20 16
4 14
10 2
17 6
19 20
10 24
19 12
5 18
13 2
10 26
23 7
14 21
13 3
24 13
8 3
3 11
12 12
12 11
31 21
20 15
9 18
18 1
10 5
2 26
16 19
19 3
26 24
11 30
9 23
15 20
16 12
6 10
17 27
21 31
25 28
13 26

6 30
15 13
4 14
28 11
1 22
11 14
21 11

33 58
50 45
21 23
23 32
35 51
4 53
52 48
43 58
46 53
3 52
25 40
46 17
37 18
5 50
1 55
25 3
25 22
35 43
43 40
17 26
30 50
16 11
1 47
26 40
45 22
9 34
45 14
19 47
19 36
18 38
5 37
33 30
22 24
55 43

3 52
32 46
35 17
20 40

    
#-*- coding:utf-8 -*-
class Edge(object):
  def __init__(self, u, v, w):
    self.source = u
    self.target = v
    self.capacity = w

  def __repr__(self):
    return "%s->%s:%s" % (self.source, self.target, self.capacity)


class FlowNetwork(object):
  def  __init__(self):
    self.adj = {}
    self.flow = {}

  def AddVertex(self, vertex):
    self.adj[vertex] = []

  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))

  def drawnetwork(self, a, g,numofjobs,numofcp,listvertex):
     #listvertex=['s', 'job1', 'job2', 'job3', 'job4', 'c1', 'c2', 't']
     map(g.AddVertex, listvertex)
     for i in range(1,1+numofjobs):#initial the edge from s to jobs
         g.AddEdge(listvertex[0],listvertex[i],1)
         #print listvertex[0],"and",listvertex[i]
     for p in range(1,1+numofjobs):#initial the edge from jobs to computers
         for q in range((1+numofjobs)+(p-1)*2,(1+numofjobs)+(p-1)*2+2):
            g.AddEdge(listvertex[p],listvertex[q],1)
            #print listvertex[p], "and", listvertex[q]
     listrecordcomputers = []
     for j in range(1+numofjobs,1+numofjobs+numofjobs*2):#initial the edge from computers to t
            #如果一个电脑已经和t有连线，再添加连线就会报错，所以想办法检验是否已经有连线。
         if listvertex[j] not in listrecordcomputers:
            listrecordcomputers.append(listvertex[j])
            g.AddEdge(listvertex[j],listvertex[-1],a)
         #print listvertex[j], "and", listvertex[-1]
     return g.MaxFlow('s', 't')

def readdata():
    alllist = []
    # list引用的是地址！！！深刻理解！所以不能在这写listunit=[]然后下面再alllist.append(listunit)
    for i in range(0, 10):
        alllist.append([])  # 个包含10个list的list

    file = open('problem1.data', 'r')
    i = 0
    for (num, value) in enumerate(file):
        if num != 0 and num != 1 and num != 2:  # remove the first,second,third line comment
            if value == "\n":  # 所以空行不是""而是"\n"
                # print "kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk"
                # print alllist[i]
                # print "alllist is",alllist
                i = i + 1
            else:
                value = value.split()  # 默认为空格
                for num in value:
                    alllist[i].append(num)
    file.close()
    return alllist



if __name__ == "__main__":
   alllist=readdata()
   #for i in range(0,len(alllist)):#对每个数据集单独计算
   for i in range(9,10):#对第7个数据集单独计算
       listnow=alllist[i]
       numofjobs=int(listnow[0])
       numofcps=int(listnow[1])#将字符串转化为int
       l=0
       r=numofjobs
       listvertex = ['s']
       jobstringlist = []
       for job in range(1,1+numofjobs):#构造listvertex里的job
           listvertex.append("job"+str(job))
           #print "listvertex now is",listvertex
       for cp in range(2,2+numofjobs*2):
           listvertex.append("cp"+listnow[cp])
       listvertex.append("t")
       print listvertex#检验结果可知 listvertex已经构造成功

       fn = FlowNetwork()
       while(l<r):
           mid = (l + r) / 2
           #print "fn is",fn
           maxflowvalue = fn.drawnetwork(mid, fn,numofjobs,numofcps,listvertex)
           if(maxflowvalue == numofjobs):#if the value of max flow == number of jobs如果能满足所有电脑工作
               print "eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee"
               print "now the mid is",mid,"now the left is",l,"now the right is",r,"and the maxflow is",maxflowvalue
               r = mid
           else:#如果不能满足所有电脑工作
               l = mid +1
               print "nnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnn"
       print "the minimum number of the max load is",l