grape.parallel_general_graph.ParallelGeneralGraph.shortest_path_list_iteration¶

ParallelGeneralGraph.shortest_path_list_iteration(nodes, shortest_path, tot_shortest_paths_list)[source]¶

Inner iteration for parallel shortest path list calculation, to update shared list.

Parameters

nodes (list) – list of nodes for which to compute the shortest path between them and all the other nodes
shortest_path (dict) – nested dictionary with key corresponding to source, while as value a dictionary keyed by target and valued by the source-target shortest path.
tot_shortest_paths_list (multiprocessing.managers.list) – list of shortest paths with at least two nodes