Defined in File GraphTools.hpp
Efficiently removes all the edges adjacent to a set of nodes that is not connected to the rest of the graph. This is meant to optimize the Kadabra algorithm.
G – The input graph.
first – Start of the range that contains the nodes in the set.
last – End of the range that contains the nodes in the set. is isolated from the rest of the graph.