| 469 | } |
| 470 | |
| 471 | void Graph::RemoveNode(Node* node) { |
| 472 | TF_DCHECK_OK(IsValidNode(node)) << node->DebugString(); |
| 473 | DCHECK(!node->IsSource()); |
| 474 | DCHECK(!node->IsSink()); |
| 475 | |
| 476 | // Remove any edges involving this node. |
| 477 | for (const Edge* e : node->in_edges_) { |
| 478 | CHECK_EQ(e->src_->out_edges_.erase(e), size_t{1}); |
| 479 | edges_[e->id_] = nullptr; |
| 480 | RecycleEdge(e); |
| 481 | --num_edges_; |
| 482 | } |
| 483 | node->in_edges_.clear(); |
| 484 | for (const Edge* e : node->out_edges_) { |
| 485 | CHECK_EQ(e->dst_->in_edges_.erase(e), size_t{1}); |
| 486 | edges_[e->id_] = nullptr; |
| 487 | RecycleEdge(e); |
| 488 | --num_edges_; |
| 489 | } |
| 490 | node->out_edges_.clear(); |
| 491 | ReleaseNode(node); |
| 492 | } |
| 493 | |
| 494 | const Edge* Graph::AddEdge(Node* source, int x, Node* dest, int y) { |
| 495 | TF_DCHECK_OK(IsValidNode(source)) << source->DebugString(); |