Fork me on GitHub

Class DynDijkstra¶

Defined in File DynDijkstra.hpp

Inheritance Relationships¶

Base Type¶

public NetworKit::DynSSSP (Class DynSSSP)

Class Documentation¶

class DynDijkstra : public NetworKit::DynSSSP ¶

Dynamic Dijkstra.

Public Functions

DynDijkstra(const Graph &G, node s, bool storePredecessors = true)¶

Creates the object for G and source s.

Parameters:

G – The graph.
s – The source node.
storePredecessors – keep track of the lists of predecessors?

virtual void run() override¶: Computes the shortest paths from the source to all other nodes.

virtual void update(GraphEvent e) override¶: Updates the distances after an edge insertion.

virtual void updateBatch(const std::vector<GraphEvent> &batch) override¶: Updates the distances after a batch of edge insertions.