generate separation constraints for all edges unless both their source and sink are in the same strongly connected component

modify the specified links lengths based on the jaccard difference between their neighbours

Tarjan's strongly connected components algorithm for directed graphs returns an array of arrays of node indicies in each of the strongly connected components. a vertex not in a SCC of two or more nodes is it's own SCC. adaptation of https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm

modify the specified link lengths based on the symmetric difference of their neighbours