I'm not sure if I follow the problem you are trying to solve. But if I view it as something like finding the set of line segments that are not subsegments, then it might helpful to sort your connection array before doing your checks.

I suspect that sorting by increasing start and decreasing end, the solution then reduces to checking if the current connection is a subconnection of the previous one. But I could be wrong.