code: def _dijkstra(
      G, source, weight, pred=None, paths=None, cutoff=None, target=None
  ):
      """Uses Dijkstra's algorithm to find shortest weighted paths from a
      single source.
  
      This is a convenience function for :func:`_dijkstra_multisource`
      with all the arguments the same, except the keyword argument
      `sources` set to ``[source]``.
  
      """
      return _dijkstra_multisource(
          G,
          [source],
          weight,
          pred=pred,
          paths=paths,
          cutoff=cutoff,
          target=target,
      )
  
imports: from collections import deque
  from heapq import heappop, heappush
  from itertools import count
  import networkx
  from networkx.algorithms.shortest_paths.generic import _build_paths_from_predecessors
label_desc: Use image node_id 10 for calling a global function with example usage: _dijkstra(G, source, weight, pred, paths, cutoff, target) and returns: _dijkstra_multisource