equal
deleted
inserted
replaced
378 // NodeIt(const NodeIt& n) : Node(n), gw(n.gw) { } |
378 // NodeIt(const NodeIt& n) : Node(n), gw(n.gw) { } |
379 NodeIt(Invalid i) : Node(i) { } |
379 NodeIt(Invalid i) : Node(i) { } |
380 NodeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _gw) : |
380 NodeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _gw) : |
381 Node(typename Graph::NodeIt(*(_gw.graph))), gw(&_gw) { |
381 Node(typename Graph::NodeIt(*(_gw.graph))), gw(&_gw) { |
382 while (*static_cast<Node*>(this)!=INVALID && |
382 while (*static_cast<Node*>(this)!=INVALID && |
383 !(*(gw->edge_filter_map))[*this]) |
383 !(*(gw->node_filter_map))[*this]) |
384 *(static_cast<Node*>(this))= |
384 *(static_cast<Node*>(this))= |
385 ++(typename Graph::NodeIt(*(gw->graph), *this)); |
385 ++(typename Graph::NodeIt(*(gw->graph), *this)); |
386 } |
386 } |
387 NodeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _gw, |
387 NodeIt(const SubGraphWrapper<Graph, NodeFilterMap, EdgeFilterMap>& _gw, |
388 const Node& n) : |
388 const Node& n) : |