/* -*- 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

       LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");

       LEMON_ASSERT(!_use_nodes, "Multiple usage of useNodes() member");

       _use_nodes = true;

       _use_nodes = true;

       for (RedNodeIt n(_graph); n != INVALID; ++n) {

       for (RedNodeIt n(_graph); n != INVALID; ++n) {

         _red_node_index.insert(std::make_pair(converter(map[n]), n));

         _red_node_index.insert(std::make_pair(converter(map[n]), n));

       }

       }

         _blue_node_index.insert(std::make_pair(converter(map[n]), n));

         _blue_node_index.insert(std::make_pair(converter(map[n]), n));

       }

       }

       return *this;

       return *this;

     }

     }