code: function singleSourceDijkstra(graph, source, weightAttribute) {
    var paths = {};
  
    abstractDijkstraMultisource(
      graph,
      [source],
      weightAttribute,
      0,
      null,
      paths
    );
  
    return paths;
  }
docs: Single source Dijkstra shortest path between given node & other nodes in
  the graph.
  
  @param  {Graph}  graph           - The graphology instance.
  @param  {string} source          - Source node.
  @param  {string} weightAttribute - Name of the weight attribute.
  @return {object}                 - An object of found paths.