Template Function NetworKit::Traversal::BFSfrom(const Graph&, InputIt, InputIt, L)¶

Function Documentation¶

template<class InputIt, typename L>
void NetworKit::Traversal::BFSfrom(const Graph &G, InputIt first, InputIt last, L handle)¶

Iterate over nodes in breadth-first search order starting from the nodes within the given range.

Parameters:

• G – The input graph.

• first – The first element of the range.

• last – The end of the range.

• handle – Takes a node as input parameter.