def _dijkstra(G, source, weight, pred=None, paths=None, cutoff=None, target=None):
 return _dijkstra_multisource(G, [source], weight, pred=pred, paths=paths, cutoff=cutoff, target=target)

def _dijkstra ( G , source , weight , pred = None , paths = None , cutoff = None , target = None ) : return _dijkstra_multisource ( G , [ source ] , weight , pred = pred , paths = paths , cutoff = cutoff , target = target )
uses dijkstras algorithm to find shortest weighted paths from a single source .