COIN-OR::LEMON - Graph Library

Changeset 1258:bdfc038f364c in lemon for test/suurballe_test.cc


Ignore:
Timestamp:
08/07/13 06:31:47 (6 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
1.1
Parents:
1248:14394c9603c2 (diff), 1257:3e711ee55d31 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge #294 to branch 1.1

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • test/suurballe_test.cc

    r1172 r1258  
    108108  int f;
    109109  VType c;
    110   ignore_unused_variable_warning(f,c);
     110  ::lemon::ignore_unused_variable_warning(f,c);
    111111
    112112  c = const_suurb_test.totalLength();
     
    120120  Path<Digraph> p = const_suurb_test.path(k);
    121121
    122   ignore_unused_variable_warning(fm);
    123   ignore_unused_variable_warning(pm);
     122  ::lemon::ignore_unused_variable_warning(fm);
     123  ::lemon::ignore_unused_variable_warning(pm);
    124124}
    125125
  • test/suurballe_test.cc

    r1257 r1258  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2011
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    8181  typedef Digraph::Arc Arc;
    8282  typedef concepts::ReadMap<Arc, VType> LengthMap;
    83  
     83
    8484  typedef Suurballe<Digraph, LengthMap> SuurballeType;
    8585
     
    105105  k = suurb_test.findFlow(n, k);
    106106  suurb_test.findPaths();
    107  
     107
    108108  int f;
    109109  VType c;
     
    119119  k = const_suurb_test.pathNum();
    120120  Path<Digraph> p = const_suurb_test.path(k);
    121  
     121
    122122  ::lemon::ignore_unused_variable_warning(fm);
    123123  ::lemon::ignore_unused_variable_warning(pm);
Note: See TracChangeset for help on using the changeset viewer.