test/lgf_reader_writer_test.cc
changeset 1270 dceba191c00d
parent 1198 4936be66d2f5
     1.1 --- a/test/lgf_reader_writer_test.cc	Fri Aug 09 14:07:27 2013 +0200
     1.2 +++ b/test/lgf_reader_writer_test.cc	Fri Aug 09 11:28:17 2013 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -385,7 +385,7 @@
    1.13    writer.edgeMap("edge_map2", edge_map, WriterConverter());
    1.14    writer.arcMap("arc_map1", arc_map);
    1.15    writer.arcMap("arc_map2", arc_map, WriterConverter());
    1.16 -  writer.node("node", n2); 
    1.17 +  writer.node("node", n2);
    1.18    writer.edge("edge", e1);
    1.19    writer.arc("arc", graph.direct(e1, false));
    1.20    writer.attribute("attr1", attr);
    1.21 @@ -492,7 +492,7 @@
    1.22    writer.arcMap("arc_map1", arc_map);
    1.23    writer.arcMap("arc_map2", arc_map, WriterConverter());
    1.24    writer.node("node", n);
    1.25 -  writer.redNode("red_node", rn1); 
    1.26 +  writer.redNode("red_node", rn1);
    1.27    writer.blueNode("blue_node", bn2);
    1.28    writer.edge("edge", e1);
    1.29    writer.arc("arc", graph.direct(e1, false));