Defined in File SPSP.hpp
public NetworKit::Algorithm
(Class Algorithm)
Class for some-pairs shortest path algorithm.
Public Functions
Creates the SPSP class for G.
G – The graph.
sourcesFirst, sourcesLast – Range of the source nodes.
Creates the SPSP class for G.
G – The graph.
sourcesFirst, sourcesLast – Range of the source nodes.
targetsFirst, targetLast – Range of the target nodes.
Sets the source nodes.
sourcesFirst, sourcesLast – Range of the new source nodes.
Sets the target nodes.
sourcesFirst, sourcesLast – Range of the new source nodes.
Computes the shortest paths from the source nodes to the target nodes using bidirectional graph explorations. If no targets nodes are provided, the algorithm computes the shortest paths from each source node to all the other nodes. The algorithm is parallel.
Returns a vector of weighted distances between all the source nodes to all the other nodes.
The shortest-path distances from the source nodes to any other node in the graph.
Returns the distance from the source u to node v or infinity if u cannot reach v.
u – A source node.
v – A node.
Returns the <node, index> map from source nodes to their index in the vector returned by SPSP::getDistances().
Map from source nodes to their index in the vector returned by SPSP::getDistances().
Returns the <node, index> map from target nodes to their index in the vector returned by SPSP::getDistances().
Map from target nodes to their index in the vector returned by SPSP::getDistances().