Fork me on GitHub

Class BidirectionalDijkstra¶

Defined in File BidirectionalDijkstra.hpp

Nested Relationships¶

Nested Types¶

Struct BidirectionalDijkstra::CompareST

Inheritance Relationships¶

Base Type¶

public NetworKit::STSP (Class STSP)

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.

Parameters:

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.