lemon/concepts/bpgraph.h
changeset 1101 15e233f588da
parent 1087 dd1443e4a34c
child 1130 0759d974de81
equal deleted inserted replaced
6:67ed65071387 7:5c1495e23c45
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     2  *
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library.
     3  * This file is a part of LEMON, a generic C++ optimization library.
     4  *
     4  *
     5  * Copyright (C) 2003-2010
     5  * Copyright (C) 2003-2013
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     8  *
     9  * Permission to use, modify and distribute this software is granted
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    10  * provided that this copyright notice appears in all copies. For
   802       /// object. If the node is not from the blue partition, then it
   802       /// object. If the node is not from the blue partition, then it
   803       /// returns INVALID.
   803       /// returns INVALID.
   804       BlueNode asBlueNode(const Node&) const { return BlueNode(); }
   804       BlueNode asBlueNode(const Node&) const { return BlueNode(); }
   805 
   805 
   806       /// \brief Gives back the red end node of the edge.
   806       /// \brief Gives back the red end node of the edge.
   807       /// 
   807       ///
   808       /// Gives back the red end node of the edge.
   808       /// Gives back the red end node of the edge.
   809       RedNode redNode(const Edge&) const { return RedNode(); }
   809       RedNode redNode(const Edge&) const { return RedNode(); }
   810 
   810 
   811       /// \brief Gives back the blue end node of the edge.
   811       /// \brief Gives back the blue end node of the edge.
   812       /// 
   812       ///
   813       /// Gives back the blue end node of the edge.
   813       /// Gives back the blue end node of the edge.
   814       BlueNode blueNode(const Edge&) const { return BlueNode(); }
   814       BlueNode blueNode(const Edge&) const { return BlueNode(); }
   815 
   815 
   816       /// \brief The first node of the edge.
   816       /// \brief The first node of the edge.
   817       ///
   817       ///