COIN-OR::LEMON - Graph Library

Changeset 1093:fb1c7da561ce in lemon-main for test


Ignore:
Timestamp:
08/09/13 11:29:40 (11 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
1094:c08d0f04c117, 1170:ad22262328b3
Phase:
public
Message:

Remove long lines (from all but one file)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/tsp_test.cc

    r1092 r1093  
    6767
    6868  int node_cnt = 0;
    69   for (typename Container::const_iterator it = p.begin(); it != p.end(); ++it) {
    70     FullGraph::Node node = *it;
    71     if (used[node]) return false;
    72     used[node] = true;
    73     ++node_cnt;
    74   }
     69  for (typename Container::const_iterator it = p.begin(); it != p.end(); ++it)
     70    {
     71      FullGraph::Node node = *it;
     72      if (used[node]) return false;
     73      used[node] = true;
     74      ++node_cnt;
     75    }
    7576
    7677  return (node_cnt == gr.nodeNum());
     
    265266  tspTestSmall<GreedyTsp<ConstMap<Edge, int> > >("Greedy");
    266267  tspTestSmall<NearestInsertionTsp<ConstMap<Edge, int> > >("Nearest Insertion");
    267   tspTestSmall<FarthestInsertionTsp<ConstMap<Edge, int> > >("Farthest Insertion");
    268   tspTestSmall<CheapestInsertionTsp<ConstMap<Edge, int> > >("Cheapest Insertion");
     268  tspTestSmall<FarthestInsertionTsp<ConstMap<Edge, int> > >
     269    ("Farthest Insertion");
     270  tspTestSmall<CheapestInsertionTsp<ConstMap<Edge, int> > >
     271    ("Cheapest Insertion");
    269272  tspTestSmall<RandomInsertionTsp<ConstMap<Edge, int> > >("Random Insertion");
    270273  tspTestSmall<ChristofidesTsp<ConstMap<Edge, int> > >("Christofides");
Note: See TracChangeset for help on using the changeset viewer.