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-2008  | 
     5  * Copyright (C) 2003-2010  | 
     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  | 
   108   mcarb_test.addSource(s);  | 
   108   mcarb_test.addSource(s);  | 
   109   mcarb_test.start();  | 
   109   mcarb_test.start();  | 
   110   n = mcarb_test.processNextNode();  | 
   110   n = mcarb_test.processNextNode();  | 
   111   b = const_mcarb_test.emptyQueue();  | 
   111   b = const_mcarb_test.emptyQueue();  | 
   112   i = const_mcarb_test.queueSize();  | 
   112   i = const_mcarb_test.queueSize();  | 
   113     | 
   113   | 
   114   c = const_mcarb_test.arborescenceCost();  | 
   114   c = const_mcarb_test.arborescenceCost();  | 
   115   b = const_mcarb_test.arborescence(e);  | 
   115   b = const_mcarb_test.arborescence(e);  | 
   116   e = const_mcarb_test.pred(n);  | 
   116   e = const_mcarb_test.pred(n);  | 
   117   const MinCostArbType::ArborescenceMap &am =  | 
   117   const MinCostArbType::ArborescenceMap &am =  | 
   118     const_mcarb_test.arborescenceMap();  | 
   118     const_mcarb_test.arborescenceMap();  | 
   119   const MinCostArbType::PredMap &pm =  | 
   119   const MinCostArbType::PredMap &pm =  | 
   120     const_mcarb_test.predMap();  | 
   120     const_mcarb_test.predMap();  | 
   121   b = const_mcarb_test.reached(n);  | 
   121   b = const_mcarb_test.reached(n);  | 
   122   b = const_mcarb_test.processed(n);  | 
   122   b = const_mcarb_test.processed(n);  | 
   123     | 
   123   | 
   124   i = const_mcarb_test.dualNum();  | 
   124   i = const_mcarb_test.dualNum();  | 
   125   c = const_mcarb_test.dualValue();  | 
   125   c = const_mcarb_test.dualValue();  | 
   126   i = const_mcarb_test.dualSize(i);  | 
   126   i = const_mcarb_test.dualSize(i);  | 
   127   c = const_mcarb_test.dualValue(i);  | 
   127   c = const_mcarb_test.dualValue(i);  | 
   128     | 
   128   | 
   129   ignore_unused_variable_warning(am);  | 
   129   ignore_unused_variable_warning(am);  | 
   130   ignore_unused_variable_warning(pm);  | 
   130   ignore_unused_variable_warning(pm);  | 
   131 }  | 
   131 }  | 
   132   | 
   132   | 
   133 int main() { | 
   133 int main() { |