COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changeset 1171:7e368d9b67f7 in lemon


Ignore:
Timestamp:
11/28/12 11:41:40 (11 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
1172:c18ed26f016c, 1173:d216e1c8b3fa, 1181:d32e4453b48c
Phase:
public
Message:

Avoid GCC 4.7 compiler warnings (#453)

Files:
11 edited

Legend:

Unmodified
Added
Removed

  • lemon/concepts/graph_components.h

    r1157 r1171  
    109109
    110110          bool b;
     111          ignore_unused_variable_warning(b);
     112
    111113          b = (ia == ib) && (ia != ib);
    112114          b = (ia == INVALID) && (ib != INVALID);

  • test/bfs_test.cc

    r632 r1171  
    6262  Arc e;
    6363  int l, i;
     64  ignore_unused_variable_warning(l,i);
    6465  bool b;
    6566  BType::DistMap d(G);
    … …  
    151152  Digraph g;
    152153  bool b;
     154  ignore_unused_variable_warning(b);
     155
    153156  bfs(g).run(Node());
    154157  b=bfs(g).run(Node(),Node());

  • test/circulation_test.cc

    r658 r1171  
    7474  VType v;
    7575  bool b;
     76  ignore_unused_variable_warning(v,b);
    7677
    7778  typedef Circulation<Digraph, CapMap, CapMap, SupplyMap>

  • test/dfs_test.cc

    r1009 r1171  
    6868  int l, i;
    6969  bool b;
     70  ignore_unused_variable_warning(l,i,b);
     71
    7072  DType::DistMap d(G);
    7173  DType::PredMap p(G);
    … …  
    152154  Digraph g;
    153155  bool b;
     156  ignore_unused_variable_warning(b);
     157
    154158  dfs(g).run(Node());
    155159  b=dfs(g).run(Node(),Node());

  • test/dijkstra_test.cc

    r632 r1171  
    6666  int i;
    6767  bool b;
     68  ignore_unused_variable_warning(l,i,b);
     69
    6870  DType::DistMap d(G);
    6971  DType::PredMap p(G);
    … …  
    163165  Digraph g;
    164166  bool b;
     167  ignore_unused_variable_warning(b);
     168
    165169  dijkstra(g,LengthMap()).run(Node());
    166170  b=dijkstra(g,LengthMap()).run(Node(),Node());

  • test/gomory_hu_test.cc

    r643 r1171  
    5151  Value v;
    5252  int d;
     53  ignore_unused_variable_warning(v,d);
    5354
    5455  GomoryHu<Graph, CapMap> gh_test(g, cap);

  • test/hao_orlin_test.cc

    r644 r1171  
    6767  CutMap cut;
    6868  Value v;
     69  ignore_unused_variable_warning(v);
    6970
    7071  HaoOrlin<Digraph, CapMap> ho_test(g, cap);

  • test/matching_test.cc

    r641 r1171  
    146146  MaxMatching<Graph>::Status stat =
    147147    const_mat_test.status(n);
     148  ignore_unused_variable_warning(stat);
    148149  const MaxMatching<Graph>::StatusMap& smap =
    149150    const_mat_test.statusMap();

  • test/min_cost_arborescence_test.cc

    r672 r1171  
    9292  VType c;
    9393  bool b;
     94  ignore_unused_variable_warning(c,b);
    9495  int i;
    9596  CostMap cost;

  • test/preflow_test.cc

    r1027 r1171  
    8787  VType v;
    8888  bool b;
     89  ignore_unused_variable_warning(v,b);
    8990
    9091  typedef Preflow<Digraph, CapMap>

  • test/suurballe_test.cc

    r670 r1171  
    108108  int f;
    109109  VType c;
     110  ignore_unused_variable_warning(f,c);
     111
    110112  c = const_suurb_test.totalLength();
    111113  f = const_suurb_test.flow(e);
Note: See TracChangeset for help on using the changeset viewer.