1.1 --- a/lemon/bits/graph_adaptor_extender.h Fri Mar 02 17:56:22 2007 +0000
1.2 +++ b/lemon/bits/graph_adaptor_extender.h Fri Mar 02 18:04:28 2007 +0000
1.3 @@ -399,28 +399,28 @@
1.4 ///
1.5 /// Returns the base node (ie. the source in this case) of the iterator
1.6 Node baseNode(const OutEdgeIt &e) const {
1.7 - return Parent::source((Edge)e);
1.8 + return Parent::source(static_cast<const Edge&>(e));
1.9 }
1.10 /// \brief Running node of the iterator
1.11 ///
1.12 /// Returns the running node (ie. the target in this case) of the
1.13 /// iterator
1.14 Node runningNode(const OutEdgeIt &e) const {
1.15 - return Parent::target((Edge)e);
1.16 + return Parent::target(static_cast<const Edge&>(e));
1.17 }
1.18
1.19 /// \brief Base node of the iterator
1.20 ///
1.21 /// Returns the base node (ie. the target in this case) of the iterator
1.22 Node baseNode(const InEdgeIt &e) const {
1.23 - return Parent::target((Edge)e);
1.24 + return Parent::target(static_cast<const Edge&>(e));
1.25 }
1.26 /// \brief Running node of the iterator
1.27 ///
1.28 /// Returns the running node (ie. the source in this case) of the
1.29 /// iterator
1.30 Node runningNode(const InEdgeIt &e) const {
1.31 - return Parent::source((Edge)e);
1.32 + return Parent::source(static_cast<const Edge&>(e));
1.33 }
1.34
1.35 /// Base node of the iterator
1.36 @@ -651,28 +651,28 @@
1.37 ///
1.38 /// Returns the base node (ie. the source in this case) of the iterator
1.39 Node baseNode(const OutEdgeIt &e) const {
1.40 - return Parent::source((Edge&)e);
1.41 + return Parent::source(static_cast<const Edge&>(e));
1.42 }
1.43 /// \brief Running node of the iterator
1.44 ///
1.45 /// Returns the running node (ie. the target in this case) of the
1.46 /// iterator
1.47 Node runningNode(const OutEdgeIt &e) const {
1.48 - return Parent::target((Edge&)e);
1.49 + return Parent::target(static_cast<const Edge&>(e));
1.50 }
1.51
1.52 /// \brief Base node of the iterator
1.53 ///
1.54 /// Returns the base node (ie. the target in this case) of the iterator
1.55 Node baseNode(const InEdgeIt &e) const {
1.56 - return Parent::target((Edge&)e);
1.57 + return Parent::target(static_cast<const Edge&>(e));
1.58 }
1.59 /// \brief Running node of the iterator
1.60 ///
1.61 /// Returns the running node (ie. the source in this case) of the
1.62 /// iterator
1.63 Node runningNode(const InEdgeIt &e) const {
1.64 - return Parent::source((Edge&)e);
1.65 + return Parent::source(static_cast<const Edge&>(e));
1.66 }
1.67
1.68 class IncEdgeIt : public Parent::UEdge {