lemon/concepts/bpgraph.h
changeset 1027 8b2b9e61d8ce
parent 1026 699c7eac2c6d
child 1028 4441b066368c
equal deleted inserted replaced
2:35b8a059faf7 3:529c54a42a1c
   798       /// This class is converts unsafely the node to blue node
   798       /// This class is converts unsafely the node to blue node
   799       /// object. If the node is not from the blue partition, then it
   799       /// object. If the node is not from the blue partition, then it
   800       /// returns INVALID.
   800       /// returns INVALID.
   801       BlueNode asBlueNode(const Node&) const { return BlueNode(); }
   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 in
       
   806       /// first and second is INVALID. If the node is from the blue
       
   807       /// partition then it is returned in second and first is
       
   808       /// INVALID. If the node INVALID then both first and second are
       
   809       /// INVALID in the return value.
       
   810       std::pair<RedNode, BlueNode> asRedBlueNode(const Node&) const {
       
   811         return std::make_pair(RedNode(), BlueNode());
       
   812       }
       
   813 
       
   814       /// \brief Gives back the red end node of the edge.
   803       /// \brief Gives back the red end node of the edge.
   815       /// 
   804       /// 
   816       /// Gives back the red end node of the edge.
   805       /// Gives back the red end node of the edge.
   817       RedNode redNode(const Edge&) const { return RedNode(); }
   806       RedNode redNode(const Edge&) const { return RedNode(); }
   818 
   807