graph Namespace Reference

Classes
class	Graph

Functions
	get_hop_distance (num_node, edge, max_hop=1)
	normalize_digraph (A)
	normalize_undigraph (A)

Function Documentation

get_hop_distance()

graph.get_hop_distance	(		num_node,
			edge,
			max_hop = 1 )

Definition at line 130 of file graph.py.

def get_hop_distance(num_node, edge, max_hop=1):
    A = np.zeros((num_node, num_node))
    for i, j in edge:
        A[j, i] = 1
        A[i, j] = 1
 
    # compute hop steps
    hop_dis = np.zeros((num_node, num_node)) + np.inf
    transfer_mat = [np.linalg.matrix_power(A, d) for d in range(max_hop + 1)]
    arrive_mat = (np.stack(transfer_mat) > 0)
    for d in range(max_hop, -1, -1):
        hop_dis[arrive_mat[d]] = d
    return hop_dis
 
 

normalize_digraph()

graph.normalize_digraph

(

A

)

Definition at line 145 of file graph.py.

def normalize_digraph(A):
    Dl = np.sum(A, 0)
    num_node = A.shape[0]
    Dn = np.zeros((num_node, num_node))
    for i in range(num_node):
        if Dl[i] > 0:
            Dn[i, i] = Dl[i]**(-1)
    AD = np.dot(A, Dn)
    return AD
 
 

normalize_undigraph()

graph.normalize_undigraph

(

A

)

Definition at line 156 of file graph.py.

def normalize_undigraph(A):
    Dl = np.sum(A, 0)
    num_node = A.shape[0]
    Dn = np.zeros((num_node, num_node))
    for i in range(num_node):
        if Dl[i] > 0:
            Dn[i, i] = Dl[i]**(-0.5)
    DAD = np.dot(np.dot(Dn, A), Dn)
    return DAD