equal
deleted
inserted
replaced
320 GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T>(_G) { } |
320 GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T>(_G) { } |
321 EdgeMap(const RevGraphWrapper<Graph>& _G, T a) : |
321 EdgeMap(const RevGraphWrapper<Graph>& _G, T a) : |
322 GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T>(_G, a) { } |
322 GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T>(_G, a) { } |
323 }; |
323 }; |
324 }; |
324 }; |
325 |
|
326 |
|
327 |
|
328 |
325 |
329 |
326 |
330 template<typename Graph> |
327 template<typename Graph> |
331 class UndirGraphWrapper { |
328 class UndirGraphWrapper { |
332 protected: |
329 protected: |
457 // return graph->aNode(e); } |
454 // return graph->aNode(e); } |
458 // template<typename I> Node bNode(const I& e) const { |
455 // template<typename I> Node bNode(const I& e) const { |
459 // return graph->bNode(e); } |
456 // return graph->bNode(e); } |
460 |
457 |
461 Node addNode() const { return graph->addNode(); } |
458 Node addNode() const { return graph->addNode(); } |
462 Edge addEdge(const Node& tail, const Node& head) const { |
459 // FIXME: ez igy nem jo, mert nem |
463 return graph->addEdge(tail, head); } |
460 // Edge addEdge(const Node& tail, const Node& head) const { |
|
461 // return graph->addEdge(tail, head); } |
464 |
462 |
465 template<typename I> void erase(const I& i) const { graph->erase(i); } |
463 template<typename I> void erase(const I& i) const { graph->erase(i); } |
466 |
464 |
467 void clear() const { graph->clear(); } |
465 void clear() const { graph->clear(); } |
468 |
466 |