/// Summary /// Time: 4 min 52 sec /// Pattern: Parameterized stub public void RemoveEdgeIf(BidirectionalGraph g) { IEdge e = RandomGraph.Edge(g, Rnd); g.RemoveEdgeIf(new DummyEdgeEqualPredicate(e, false)); g.RemoveEdgeIf(new DummyEdgeEqualPredicate(e, true)); }
public void RemoveEdgeIf() { IMutableEdgeListGraph g = Graph; IEdge e = RandomGraph.Edge(g, Rnd); g.RemoveEdgeIf(new DummyEdgeEqualPredicate(e, false)); g.RemoveEdgeIf(new DummyEdgeEqualPredicate(e, true)); }
public void RemoveEdgeIf(IMutableEdgeListGraph g) { if (g.EdgesEmpty) { return; } IEdge e = RandomGraph.Edge(g, Rnd); g.RemoveEdgeIf(new DummyEdgeEqualPredicate(e, false)); g.RemoveEdgeIf(new DummyEdgeEqualPredicate(e, true)); }