Weighted PageRank
The only difference between weighted PageRank and standard PageRank is that edges have weights, and the influence that a vertex receives from an inneighbor is multiplied by the weight of the inedge.
Specifications
tg_pageRank_wt (SET<STRING> v_type, SET<STRING> e_type, STRING wt_attr,
FLOAT max_change=0.001, INT max_iter=25, FLOAT damping=0.85, INT top_k=100,
BOOL print_accum = TRUE, STRING result_attr = "", STRING file_path = "",
BOOL display_edges = FALSE)
Characteristic  Value 

Result 
Computes a weighted PageRank value (FLOAT type) for each vertex. 
Input Parameters 

Result Size 
V = number of vertices 
Time Complexity 
O(E*k), E = number of edges, k = number of iterations. The number of iterations is datadependent, but the user can set a maximum. Parallel processing reduces the time needed for computation. 
Graph Types 
Directed edges 