154 int id(const ANode& v) const { return graph->id(v); } |
154 int id(const ANode& v) const { return graph->id(v); } |
155 int id(const BNode& v) const { return graph->id(v); } |
155 int id(const BNode& v) const { return graph->id(v); } |
156 int id(const Edge& e) const { return graph->id(e); } |
156 int id(const Edge& e) const { return graph->id(e); } |
157 int id(const UEdge& e) const { return graph->id(e); } |
157 int id(const UEdge& e) const { return graph->id(e); } |
158 |
158 |
159 Node fromNodeId(int ix) const { return graph->fromNodeId(ix); } |
159 Node nodeFromId(int ix) const { return graph->nodeFromId(ix); } |
160 ANode nodeFromANodeId(int ix) const { return graph->nodeFromANodeId(ix); } |
160 ANode nodeFromANodeId(int ix) const { return graph->nodeFromANodeId(ix); } |
161 BNode nodeFromBNodeId(int ix) const { return graph->nodeFromBNodeId(ix); } |
161 BNode nodeFromBNodeId(int ix) const { return graph->nodeFromBNodeId(ix); } |
162 Edge fromEdgeId(int ix) const { return graph->fromEdgeId(ix); } |
162 Edge edgeFromId(int ix) const { return graph->edgeFromId(ix); } |
163 UEdge fromUEdgeId(int ix) const { return graph->fromUEdgeId(ix); } |
163 UEdge uEdgeFromId(int ix) const { return graph->uEdgeFromId(ix); } |
164 |
164 |
165 int maxNodeId() const { return graph->maxNodeId(); } |
165 int maxNodeId() const { return graph->maxNodeId(); } |
166 int maxANodeId() const { return graph->maxANodeId(); } |
166 int maxANodeId() const { return graph->maxANodeId(); } |
167 int maxBNodeId() const { return graph->maxBNodeId(); } |
167 int maxBNodeId() const { return graph->maxBNodeId(); } |
168 int maxEdgeId() const { return graph->maxEdgeId(); } |
168 int maxEdgeId() const { return graph->maxEdgeId(); } |