Class MultiTargetDijkstra¶

Inheritance Relationships¶

Class Documentation¶

class MultiTargetDijkstra : public NetworKit::STSP¶

Computes the shortest-path distance from a single source to multiple targets in weighted graphs.

Public Functions

template<class InputIt>
inline MultiTargetDijkstra(const Graph &G, node source, InputIt targetsFirst, InputIt targetsLast)¶

Creates the MultiTargetDijkstra class for a graph G, source node source, and multiple target nodes.

Parameters:

• G – The graph.

• source – The source node.

• targetsFirst, targetsLast – Range of target nodes.

virtual void run() override¶

The generic run method which calls runImpl() and takes care of setting hasRun to the appropriate value.