grape.parallel_general_graph.ParallelGeneralGraph.dijkstra_iteration_parallel¶

ParallelGeneralGraph.dijkstra_iteration_parallel(out_queue, nodes)[source]¶

Parallel SSSP algorithm based on Dijkstra’s method.

Parameters

out_queue (multiprocessing.queues.Queue) – multiprocessing queue
nodes (list) – list of starting nodes from which the SSSP should be computed to every other target node in the graph

Note

Edges weight is taken into account. Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.