equal
deleted
inserted
replaced
1386 // Node bNode(const InEdgeIt& e) const { |
1386 // Node bNode(const InEdgeIt& e) const { |
1387 // return Node(this->graph->bNode(e.e)); } |
1387 // return Node(this->graph->bNode(e.e)); } |
1388 |
1388 |
1389 void erase(const Edge& e) const { |
1389 void erase(const Edge& e) const { |
1390 Node n=tail(e); |
1390 Node n=tail(e); |
1391 typename Graph::OutEdgeIt f(*graph, n); |
1391 typename Graph::OutEdgeIt f(*Parent::graph, n); |
1392 ++f; |
1392 ++f; |
1393 first_out_edges->set(n, f); |
1393 first_out_edges->set(n, f); |
1394 } |
1394 } |
1395 }; |
1395 }; |
1396 |
1396 |