Defined in File DFS.hpp
Iterate over edges in depth-first search order starting from the given source node.
G – The input graph.
source – The source node.
handle – Takes the source node, target node, weight and ID of each discovery edge.
std::runtime_error – If the source node is not in the graph.