1.1 --- a/lemon/concepts/graph_components.h Wed Jan 11 22:21:07 2012 +0100
1.2 +++ b/lemon/concepts/graph_components.h Wed Jan 11 22:43:50 2012 +0100
1.3 @@ -428,17 +428,6 @@
1.4 /// returns INVALID.
1.5 BlueNode asBlueNode(const Node&) const { return BlueNode(); }
1.6
1.7 - /// \brief Convert the node to either red or blue node.
1.8 - ///
1.9 - /// If the node is from the red partition then it is returned in
1.10 - /// first and second is INVALID. If the node is from the blue
1.11 - /// partition then it is returned in second and first is
1.12 - /// INVALID. If the node INVALID then both first and second are
1.13 - /// INVALID in the return value.
1.14 - std::pair<RedNode, BlueNode> asRedBlueNode(const Node&) const {
1.15 - return std::make_pair(RedNode(), BlueNode());
1.16 - }
1.17 -
1.18 template <typename _BpGraph>
1.19 struct Constraints {
1.20 typedef typename _BpGraph::Node Node;
1.21 @@ -467,8 +456,7 @@
1.22 bn = bpgraph.asBlueNodeUnsafe(bnan);
1.23 rn = bpgraph.asRedNode(rnan);
1.24 bn = bpgraph.asBlueNode(bnan);
1.25 - std::pair<RedNode, BlueNode> p = bpgraph.asRedBlueNode(rnan);
1.26 - ignore_unused_variable_warning(b,p);
1.27 + ignore_unused_variable_warning(b);
1.28 }
1.29 }
1.30