/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

       ///

       ///

       /// Gives back %true for blue nodes.

       /// Gives back %true for blue nodes.

       bool blue(const Node&) const { return true; }

       bool blue(const Node&) const { return true; }

       /// \brief Gives back the red end node of the edge.

       /// \brief Gives back the red end node of the edge.

       /// Gives back the red end node of the edge.

       /// Gives back the red end node of the edge.

       RedNode redNode(const Edge&) const { return RedNode(); }

       RedNode redNode(const Edge&) const { return RedNode(); }

       /// \brief Gives back the blue end node of the edge.

       /// \brief Gives back the blue end node of the edge.

       /// Gives back the blue end node of the edge.

       /// Gives back the blue end node of the edge.

       BlueNode blueNode(const Edge&) const { return BlueNode(); }

       BlueNode blueNode(const Edge&) const { return BlueNode(); }

       /// \brief Converts the node to red node object.

       /// \brief Converts the node to red node object.

       ///

       ///

       typedef typename Base::Node Node;

       typedef typename Base::Node Node;

       typedef typename Base::RedNode RedNode;

       typedef typename Base::RedNode RedNode;

       typedef typename Base::BlueNode BlueNode;

       typedef typename Base::BlueNode BlueNode;

       typedef typename Base::Arc Arc;

       typedef typename Base::Arc Arc;

       typedef typename Base::Edge Edge;

       typedef typename Base::Edge Edge;

       typedef IterableBpGraphComponent BpGraph;

       typedef IterableBpGraphComponent BpGraph;

       using IterableGraphComponent<BAS>::first;

       using IterableGraphComponent<BAS>::first;

       using IterableGraphComponent<BAS>::next;

       using IterableGraphComponent<BAS>::next;

         void constraints() {

         void constraints() {

           checkConcept<IterableGraphComponent<Base>, _BpGraph>();

           checkConcept<IterableGraphComponent<Base>, _BpGraph>();

           typename _BpGraph::RedNode rn(INVALID);

           typename _BpGraph::RedNode rn(INVALID);

           bpgraph.first(rn);

           bpgraph.first(rn);

           typename _BpGraph::BlueNode bn(INVALID);

           typename _BpGraph::BlueNode bn(INVALID);

           bpgraph.first(bn);

           bpgraph.first(bn);

           bpgraph.next(bn);

           bpgraph.next(bn);

           checkConcept<GraphItemIt<_BpGraph, typename _BpGraph::RedNode>,

           checkConcept<GraphItemIt<_BpGraph, typename _BpGraph::RedNode>,