Improve the way we identify cycle detection

[MarkRaadsen]

Now use BFS but should be simpler using travel time cost information

we can state that a cycle is introduced by adding a link ij if (link_tt_ij + cost_to_vertex_i) < cost_to_vertex_j of the network min_path tree.