示例#1
0
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
示例#2
0
文件: Loopset.py 项目: eebart/SILS
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
示例#3
0
文件: SILS.py 项目: eebart/SILS
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