nl_tokens: This function finds the shortest path from each node to every other reachable node in the graph . It is similar to [ alg . dijkstra ] [] but instead of returning a single - source array it returns a mapping of of source - > alg . dijksta ( g source weightFunc incidentFunc ) .
pl_tokens: function dijkstraAll ( g , weightFunc , incidentFunc ) { var results = { } ; g . nodes ( ) . forEach ( function ( u ) { results [ u ] = dijkstra ( g , u , weightFunc , incidentFunc ) ; } ) ; return <mask> ; }