lemon/bits/graph_adaptor_extender.h
changeset 2389 df6a32249b46
parent 2231 06faf3f06d67
child 2391 14a343be7a5a
equal deleted inserted replaced
5:95eb914ed0eb 6:2aeabfc7b1f5
   397 
   397 
   398     /// \brief Base node of the iterator
   398     /// \brief Base node of the iterator
   399     ///
   399     ///
   400     /// Returns the base node (ie. the source in this case) of the iterator
   400     /// Returns the base node (ie. the source in this case) of the iterator
   401     Node baseNode(const OutEdgeIt &e) const {
   401     Node baseNode(const OutEdgeIt &e) const {
   402       return Parent::source((Edge)e);
   402       return Parent::source(static_cast<const Edge&>(e));
   403     }
   403     }
   404     /// \brief Running node of the iterator
   404     /// \brief Running node of the iterator
   405     ///
   405     ///
   406     /// Returns the running node (ie. the target in this case) of the
   406     /// Returns the running node (ie. the target in this case) of the
   407     /// iterator
   407     /// iterator
   408     Node runningNode(const OutEdgeIt &e) const {
   408     Node runningNode(const OutEdgeIt &e) const {
   409       return Parent::target((Edge)e);
   409       return Parent::target(static_cast<const Edge&>(e));
   410     }
   410     }
   411 
   411 
   412     /// \brief Base node of the iterator
   412     /// \brief Base node of the iterator
   413     ///
   413     ///
   414     /// Returns the base node (ie. the target in this case) of the iterator
   414     /// Returns the base node (ie. the target in this case) of the iterator
   415     Node baseNode(const InEdgeIt &e) const {
   415     Node baseNode(const InEdgeIt &e) const {
   416       return Parent::target((Edge)e);
   416       return Parent::target(static_cast<const Edge&>(e));
   417     }
   417     }
   418     /// \brief Running node of the iterator
   418     /// \brief Running node of the iterator
   419     ///
   419     ///
   420     /// Returns the running node (ie. the source in this case) of the
   420     /// Returns the running node (ie. the source in this case) of the
   421     /// iterator
   421     /// iterator
   422     Node runningNode(const InEdgeIt &e) const {
   422     Node runningNode(const InEdgeIt &e) const {
   423       return Parent::source((Edge)e);
   423       return Parent::source(static_cast<const Edge&>(e));
   424     }
   424     }
   425 
   425 
   426     /// Base node of the iterator
   426     /// Base node of the iterator
   427     ///
   427     ///
   428     /// Returns the base node of the iterator
   428     /// Returns the base node of the iterator
   649   
   649   
   650     /// \brief Base node of the iterator
   650     /// \brief Base node of the iterator
   651     ///
   651     ///
   652     /// Returns the base node (ie. the source in this case) of the iterator
   652     /// Returns the base node (ie. the source in this case) of the iterator
   653     Node baseNode(const OutEdgeIt &e) const {
   653     Node baseNode(const OutEdgeIt &e) const {
   654       return Parent::source((Edge&)e);
   654       return Parent::source(static_cast<const Edge&>(e));
   655     }
   655     }
   656     /// \brief Running node of the iterator
   656     /// \brief Running node of the iterator
   657     ///
   657     ///
   658     /// Returns the running node (ie. the target in this case) of the
   658     /// Returns the running node (ie. the target in this case) of the
   659     /// iterator
   659     /// iterator
   660     Node runningNode(const OutEdgeIt &e) const {
   660     Node runningNode(const OutEdgeIt &e) const {
   661       return Parent::target((Edge&)e);
   661       return Parent::target(static_cast<const Edge&>(e));
   662     }
   662     }
   663   
   663   
   664     /// \brief Base node of the iterator
   664     /// \brief Base node of the iterator
   665     ///
   665     ///
   666     /// Returns the base node (ie. the target in this case) of the iterator
   666     /// Returns the base node (ie. the target in this case) of the iterator
   667     Node baseNode(const InEdgeIt &e) const {
   667     Node baseNode(const InEdgeIt &e) const {
   668       return Parent::target((Edge&)e);
   668       return Parent::target(static_cast<const Edge&>(e));
   669     }
   669     }
   670     /// \brief Running node of the iterator
   670     /// \brief Running node of the iterator
   671     ///
   671     ///
   672     /// Returns the running node (ie. the source in this case) of the
   672     /// Returns the running node (ie. the source in this case) of the
   673     /// iterator
   673     /// iterator
   674     Node runningNode(const InEdgeIt &e) const {
   674     Node runningNode(const InEdgeIt &e) const {
   675       return Parent::source((Edge&)e);
   675       return Parent::source(static_cast<const Edge&>(e));
   676     }
   676     }
   677   
   677   
   678     class IncEdgeIt : public Parent::UEdge { 
   678     class IncEdgeIt : public Parent::UEdge { 
   679       friend class BpUGraphAdaptorExtender;
   679       friend class BpUGraphAdaptorExtender;
   680       const Graph* graph;
   680       const Graph* graph;