Class BidirectionalDijkstra

Nested Relationships

Nested Types

Inheritance Relationships

Base Type

Class Documentation

class BidirectionalDijkstra : public NetworKit::STSP

Public Functions

inline BidirectionalDijkstra(const Graph &G, node source, node target, bool storePred = true)

Creates the BidirectionalDijkstra class for a graph G, source node source, and target node target.

  • G – The graph.

  • source – The source node.

  • target – The target node.

  • storePred – If true, the algorithm will also store the predecessors and reconstruct a shortest path from source and target.

virtual void run() override

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