def distance(graph):
#Must be bettered if more than one cycle, works on Yeast
adj = prt.adj(graph);
B = prt.binAddI(adj); D = prt.binSub(B, np.identity(len(adj),float))
prevS = B
for i in range(2,len(adj),1):
curS = prt.binPrd(B, prevS)
D = D + i*(curS-prevS)
prevS = curS
return D
def distance(graph):
adj = prt.adj(graph);
B = prt.binAddI(adj); D = prt.binSub(B, np.identity(len(adj),float))
prevS = B
for i in range(2,len(adj),1):
curS = prt.binPrd(B, prevS)
D = D + i*(curS-prevS)
prevS = curS
return D
def distance(graph):
#Must be bettered if more than one cycle, works on Yeast
adj = prt.adj(graph)
B = prt.binAddI(adj)
D = prt.binSub(B, np.identity(len(adj), float))
prevS = B
for i in range(2, len(adj), 1):
curS = prt.binPrd(B, prevS)
D = D + i * (curS - prevS)
prevS = curS
return D
