equal
deleted
inserted
replaced
54 |
54 |
55 int maxId(Arc) const { |
55 int maxId(Arc) const { |
56 return Parent::maxArcId(); |
56 return Parent::maxArcId(); |
57 } |
57 } |
58 |
58 |
59 Node fromId(int id, Node) const { |
59 static Node fromId(int id, Node) { |
60 return Parent::nodeFromId(id); |
60 return Parent::nodeFromId(id); |
61 } |
61 } |
62 |
62 |
63 Arc fromId(int id, Arc) const { |
63 static Arc fromId(int id, Arc) { |
64 return Parent::arcFromId(id); |
64 return Parent::arcFromId(id); |
65 } |
65 } |
66 |
66 |
67 Node oppositeNode(const Node &node, const Arc &arc) const { |
67 Node oppositeNode(const Node &node, const Arc &arc) const { |
68 if (node == Parent::source(arc)) |
68 if (node == Parent::source(arc)) |
353 |
353 |
354 int maxId(Edge) const { |
354 int maxId(Edge) const { |
355 return Parent::maxEdgeId(); |
355 return Parent::maxEdgeId(); |
356 } |
356 } |
357 |
357 |
358 Node fromId(int id, Node) const { |
358 static Node fromId(int id, Node) { |
359 return Parent::nodeFromId(id); |
359 return Parent::nodeFromId(id); |
360 } |
360 } |
361 |
361 |
362 Arc fromId(int id, Arc) const { |
362 static Arc fromId(int id, Arc) { |
363 return Parent::arcFromId(id); |
363 return Parent::arcFromId(id); |
364 } |
364 } |
365 |
365 |
366 Edge fromId(int id, Edge) const { |
366 static Edge fromId(int id, Edge) { |
367 return Parent::edgeFromId(id); |
367 return Parent::edgeFromId(id); |
368 } |
368 } |
369 |
369 |
370 Node oppositeNode(const Node &n, const Edge &e) const { |
370 Node oppositeNode(const Node &n, const Edge &e) const { |
371 if( n == Parent::u(e)) |
371 if( n == Parent::u(e)) |