equal
deleted
inserted
replaced
123 |
123 |
124 int id(const Node& v) const { return graph->id(v); } |
124 int id(const Node& v) const { return graph->id(v); } |
125 int id(const Edge& e) const { return graph->id(e); } |
125 int id(const Edge& e) const { return graph->id(e); } |
126 int id(const UEdge& e) const { return graph->id(e); } |
126 int id(const UEdge& e) const { return graph->id(e); } |
127 |
127 |
128 Node fromNodeId(int ix) const { |
128 Node nodeFromId(int ix) const { |
129 return graph->fromNodeId(ix); |
129 return graph->nodeFromId(ix); |
130 } |
130 } |
131 |
131 |
132 Edge fromEdgeId(int ix) const { |
132 Edge edgeFromId(int ix) const { |
133 return graph->fromEdgeId(ix); |
133 return graph->edgeFromId(ix); |
134 } |
134 } |
135 |
135 |
136 UEdge fromUEdgeId(int ix) const { |
136 UEdge uEdgeFromId(int ix) const { |
137 return graph->fromUEdgeId(ix); |
137 return graph->uEdgeFromId(ix); |
138 } |
138 } |
139 |
139 |
140 int maxNodeId() const { |
140 int maxNodeId() const { |
141 return graph->maxNodeId(); |
141 return graph->maxNodeId(); |
142 } |
142 } |