Class DynBFS¶

Inheritance Relationships¶

Class Documentation¶

class DynBFS : public NetworKit::DynSSSP¶

Dynamic breadth-first search.

Public Functions

DynBFS(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.

inline bigfloat getNumberOfPaths(node t) const¶