Find and remove any connection between a and b if there is one, whether it is *a -> b* or b -> a*. We know that their may only be one edge as our API does not allow for creating a cyclic graph. Returns true if an edge was removed, returns false if there was no edge at the given index. Graph will re-prepare its visit order if some edge was removed. Note: If you have an index to the edge you want
(&mut self, a: NodeIndex, b: NodeIndex)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected