equal
deleted
inserted
replaced
959 return Node(graph->addNode()); |
959 return Node(graph->addNode()); |
960 } |
960 } |
961 |
961 |
962 Edge addEdge(const Node& source, const Node& target) const { |
962 Edge addEdge(const Node& source, const Node& target) const { |
963 Edge edge = graph->addEdge(source, target); |
963 Edge edge = graph->addEdge(source, target); |
964 (*direction)[edge] = graph->source(edge) == source; |
964 direction->set(edge, graph->source(edge) == source); |
965 return edge; |
965 return edge; |
966 } |
966 } |
967 |
967 |
968 void erase(const Node& i) const { graph->erase(i); } |
968 void erase(const Node& i) const { graph->erase(i); } |
969 void erase(const Edge& i) const { graph->erase(i); } |
969 void erase(const Edge& i) const { graph->erase(i); } |