/// the node-iterator cares only the filter on the node-set, and the 

   /// the node-iterator cares only the filter on the node-set, and the 

   /// edge-iterator cares only the filter on the edge-set.

   /// edge-iterator cares only the filter on the edge-set.

   /// This way the edge-map

   /// This way the edge-map

   /// should filter all edges which's source or target is filtered by the 

   /// should filter all edges which's source or target is filtered by the 

   /// node-filter.

   /// node-filter.

   /// typedef ListGraph Graph;

   /// typedef ListGraph Graph;

   /// Graph g;

   /// Graph g;

   /// typedef Graph::Node Node;

   /// typedef Graph::Node Node;

   /// typedef Graph::Edge Edge;

   /// typedef Graph::Edge Edge;

   /// Node u=g.addNode(); //node of id 0

   /// Node u=g.addNode(); //node of id 0

   /// typedef SubGraphAdaptor<Graph, Graph::NodeMap<bool>, Graph::EdgeMap<bool> > SubGW;

   /// typedef SubGraphAdaptor<Graph, Graph::NodeMap<bool>, Graph::EdgeMap<bool> > SubGW;

   /// SubGW gw(g, nm, em);

   /// SubGW gw(g, nm, em);

   /// for (SubGW::NodeIt n(gw); n!=INVALID; ++n) std::cout << g.id(n) << std::endl;

   /// for (SubGW::NodeIt n(gw); n!=INVALID; ++n) std::cout << g.id(n) << std::endl;

   /// std::cout << ":-)" << std::endl;

   /// std::cout << ":-)" << std::endl;

   /// for (SubGW::EdgeIt e(gw); e!=INVALID; ++e) std::cout << g.id(e) << std::endl;

   /// for (SubGW::EdgeIt e(gw); e!=INVALID; ++e) std::cout << g.id(e) << std::endl;

   /// The output of the above code is the following.

   /// The output of the above code is the following.

   /// 1

   /// 1

   /// :-)

   /// :-)

   /// 1

   /// 1

   /// Note that \c n is of type \c SubGW::NodeIt, but it can be converted to

   /// Note that \c n is of type \c SubGW::NodeIt, but it can be converted to

   /// \c Graph::Node that is why \c g.id(n) can be applied.

   /// \c Graph::Node that is why \c g.id(n) can be applied.

   /// 

   /// 

   /// For other examples see also the documentation of NodeSubGraphAdaptor and 

   /// For other examples see also the documentation of NodeSubGraphAdaptor and 

   /// EdgeSubGraphAdaptor.

   /// EdgeSubGraphAdaptor.