equal
deleted
inserted
replaced
464 bool hidden(const Node& n) const { return !(*node_filter_map)[n]; } |
464 bool hidden(const Node& n) const { return !(*node_filter_map)[n]; } |
465 |
465 |
466 /// Returns true if \c n is hidden. |
466 /// Returns true if \c n is hidden. |
467 bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; } |
467 bool hidden(const Edge& e) const { return !(*edge_filter_map)[e]; } |
468 |
468 |
469 /// This is a linear time operation an works only if |
469 /// This is a linear time operation and works only if |
470 /// NodeIt is defined. |
470 /// NodeIt is defined. |
471 int nodeNum() const { |
471 int nodeNum() const { |
472 int i=0; |
472 int i=0; |
473 NodeIt n; |
473 NodeIt n; |
474 for (this->first(n); this->valid(n); this->next(n)) ++i; |
474 for (this->first(n); this->valid(n); this->next(n)) ++i; |