Coauthorship Network Mining for Scholar Communication and Collaboration Path Recommendation

Algorithm 2

Bellman–Ford algorithm.

 Inputs:

 s: start of path

 e: end of path

 G: undirected weighted graph composed of all nodes

 Output:

 path: shortest path from node start to node end

 dist: shortest path length from node start to node end

 for to

    for each edge()

    RELAX()

 for each edge()

    if

     return FALSE

 return TRUE