Changeset 1195:8b2b9e61d8ce in lemon for lemon/concepts
- Timestamp:
- 01/11/12 22:43:50 (12 years ago)
- Branch:
- default
- Phase:
- public
- Location:
- lemon/concepts
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concepts/bpgraph.h
r1194 r1195 801 801 BlueNode asBlueNode(const Node&) const { return BlueNode(); } 802 802 803 /// \brief Convert the node to either red or blue node.804 ///805 /// If the node is from the red partition then it is returned in806 /// first and second is INVALID. If the node is from the blue807 /// partition then it is returned in second and first is808 /// INVALID. If the node INVALID then both first and second are809 /// INVALID in the return value.810 std::pair<RedNode, BlueNode> asRedBlueNode(const Node&) const {811 return std::make_pair(RedNode(), BlueNode());812 }813 814 803 /// \brief Gives back the red end node of the edge. 815 804 /// -
lemon/concepts/graph_components.h
r1194 r1195 428 428 /// returns INVALID. 429 429 BlueNode asBlueNode(const Node&) const { return BlueNode(); } 430 431 /// \brief Convert the node to either red or blue node.432 ///433 /// If the node is from the red partition then it is returned in434 /// first and second is INVALID. If the node is from the blue435 /// partition then it is returned in second and first is436 /// INVALID. If the node INVALID then both first and second are437 /// INVALID in the return value.438 std::pair<RedNode, BlueNode> asRedBlueNode(const Node&) const {439 return std::make_pair(RedNode(), BlueNode());440 }441 430 442 431 template <typename _BpGraph> … … 468 457 rn = bpgraph.asRedNode(rnan); 469 458 bn = bpgraph.asBlueNode(bnan); 470 std::pair<RedNode, BlueNode> p = bpgraph.asRedBlueNode(rnan); 471 ignore_unused_variable_warning(b,p); 459 ignore_unused_variable_warning(b); 472 460 } 473 461 }
Note: See TracChangeset
for help on using the changeset viewer.