code: def all_pairs_dijkstra_path(G, cutoff=None, weight="weight"):
      """Compute shortest paths between all nodes in a weighted graph.
  
      Parameters
      ----------
      G : NetworkX graph
  
      cutoff : integer or float, optional
          Length (sum of edge weights) at which the search is stopped.
          If cutoff is provided, only return paths with summed weight <= cutoff.
  
      weight : string or function
          If this is a string, then edge weights will be accessed via the
          edge attribute with this key (that is, the weight of the edge
          joining `u` to `v` will be ``G.edges[u, v][weight]``). If no
          such edge attribute exists, the weight of the edge is assumed to
          be one.
  
          If this is a function, the weight of an edge is the value
          returned by the function. The function must accept exactly three
          positional arguments: the two endpoints of an edge and the
          dictionary of edge attributes for that edge. The function must
          return a number or None to indicate a hidden edge.
  
      Returns
      -------
      paths : iterator
          (source, dictionary) iterator with dictionary keyed by target and
          shortest path as the key value.
  
      Examples
      --------
      >>> G = nx.path_graph(5)
      >>> path = dict(nx.all_pairs_dijkstra_path(G))
      >>> path[0][4]
      [0, 1, 2, 3, 4]
  
      Notes
      -----
      Edge weight attributes must be numerical.
      Distances are calculated as sums of weighted edges traversed.
  
      See Also
      --------
      floyd_warshall, all_pairs_bellman_ford_path
  
      """
      path = single_source_dijkstra_path
      # TODO This can be trivially parallelized.
      for n in G:
          yield (n, path(G, n, cutoff=cutoff, weight=weight))
  
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 15 for calling a global function with example usage: all_pairs_dijkstra_path(G, cutoff, weight) without return types