diff -r 699c7eac2c6d -r 8b2b9e61d8ce lemon/concepts/bpgraph.h
--- a/lemon/concepts/bpgraph.h	Wed Jan 11 22:21:07 2012 +0100
+++ b/lemon/concepts/bpgraph.h	Wed Jan 11 22:43:50 2012 +0100
@@ -800,17 +800,6 @@
       /// returns INVALID.
       BlueNode asBlueNode(const Node&) const { return BlueNode(); }
 
-      /// \brief Convert the node to either red or blue node.
-      ///
-      /// If the node is from the red partition then it is returned in
-      /// first and second is INVALID. If the node is from the blue
-      /// partition then it is returned in second and first is
-      /// INVALID. If the node INVALID then both first and second are
-      /// INVALID in the return value.
-      std::pair<RedNode, BlueNode> asRedBlueNode(const Node&) const {
-        return std::make_pair(RedNode(), BlueNode());
-      }
-
       /// \brief Gives back the red end node of the edge.
       /// 
       /// Gives back the red end node of the edge.