Do you know why my algorithm is not work right? Give a working python logarithm for this problem. The code must print the same result as the test case example.

Task is next:

Given is a data network with n computers and connections between them. Through each connection, information can be sent from one machine to another at a certain number of bits per second.

Your task is to find out what is the maximum amount of data that can be transferred from a given machine to another in one second.

Implement a Download class with the following methods:

add$\_$link adds a connection from machine a to machine b that transfers x bits per second

calculate calculates the maximum possible transfer amount from machine a to machine b

Implement the class in the file download.py according to the following example.

class Download:

def $\_\_$init$\_\_($self$,$ n$)$:

# TRUE

def add$\_$link$($self$,$ a$,$ b$,$ x$)$:

# TRUE

def calculate$($self$,$ a$,$ b$)$:

# TRUE

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

d $=$ Download$(5)$

print$($d$.$calculate$(3,4))$ #print must be givn $0$

d$.$add$\_$link$(5,3,6)$

print$($d$.$calculate$(5,4))$ #print must be givn $0$

print$($d$.$calculate$(4,5))$ #print must be givn $0$

print$($d$.$calculate$(5,1))$ #print must be givn $0$

d$.$add$\_$link$(5,4,9)$

d$.$add$\_$link$(1,2,10)$

print$($d$.$calculate$(3,1))$ #print must be givn $0$

print$($d$.$calculate$(2,4))$ #print must be givn $0$

print$($d$.$calculate$(5,4))$ #print must be givn $9$

d$.$add$\_$link$(5,2,9)$

print$($d$.$calculate$(1,5))$ #print must be givn $0$

d$.$add$\_$link$(3,5,2)$

d$.$add$\_$link$(1,3,2)$

d$.$add$\_$link$(5,4,9)$

print$($d$.$calculate$(2,3))$ #print must be givn $0$

print$($d$.$calculate$(1,3))$ #print must be givn $2$

print$($d$.$calculate$(3,2))$ #print must be givn $2$

print$($d$.$calculate$(5,4))$ #print must be givn $18$

print$($d$.$calculate$(4,5))$ #print must be givn $0$

d$.$add$\_$link$(4,3,9)$

print$($d$.$calculate$(4,5))$ #print must be givn $2$

print$($d$.$calculate$(2,4))$ #print must be givn $0$

print$($d$.$calculate$(4,5))$ #print must be givn $2$

d$.$add$\_$link$(5,1,6)$

d$.$add$\_$link$(3,5,3)$

d$.$add$\_$link$(4,5,2)$

print$($d$.$calculate$(3,4))$ #print must be givn $0$

MY ALGORITHM:

class Download:

def $\_\_$init$\_\_($self$,$ n$)$:

self.n $=$ n

self.graph $=\{\}$

for i in range$(1,$ n$+1)$:

self.graph$[$i$]=\{\}$

def add$\_$link$($self$,$ a$,$ b$,$ capacity$)$:

if b not in self.graph$[$a$]$:

self.graph$[$a$][$b$]=0$

self.graph$[$a$][$b$]+=$ capacity

if a not in self.graph$[$b$]$:

self.graph$[$b$][$a$]=0$

def bfs$($self$,$ source, sink, parent$)$:

visited $=$ set$()$

queue $=[$source$]$

visited.add$($source$)$

while queue:

current $=$ queue.pop$(0)$

if current $==$ sink:

return True

for adj in self.graph$[$current$]$:

if adj not in visited and self.graph$[$current$][$adj$]>0$:

queue.append$($adj$)$

visited.add$($adj$)$

parent$[$adj$]=$ current

if adj $==$ sink:

return True

return False

def calculate$($self$,$ source, sink$)$:

parent $=\{\}$

max$\_$flow $=0$

while self.bfs$($source$,$ sink$,$ parent$)$:

path$\_$flow $=$ float$(\text{'}$Inf$\text{'})$

s $=$ sink

while s $!=$ source:

path$\_$flow $=$ min$($path$\_$flow, self.graph$[$parent$[$s$]][$s$])$

s $=$ parent$[$s$]$

v $=$ sink

while v $!=$ source:

u $=$ parent$[$v$]$

self.graph$[$u$][$v$]-=$ path$\_$flow

self.graph$[$v$][$u$]+=$ path$\_$flow

v $=$ u

max$\_$flow $+=$ path$\_$flow

return max$\_$flow