test/lgf_reader_writer_test.cc
changeset 1118 e00d7b681d8e
parent 1030 4936be66d2f5
equal deleted inserted replaced
0:3ba6ba2a6e17 1:1b1a8d770d11
     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-2010
     5  * Copyright (C) 2003-2013
     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
   383   writer.nodeMap("node_map2", node_map, WriterConverter());
   383   writer.nodeMap("node_map2", node_map, WriterConverter());
   384   writer.edgeMap("edge_map1", edge_map);
   384   writer.edgeMap("edge_map1", edge_map);
   385   writer.edgeMap("edge_map2", edge_map, WriterConverter());
   385   writer.edgeMap("edge_map2", edge_map, WriterConverter());
   386   writer.arcMap("arc_map1", arc_map);
   386   writer.arcMap("arc_map1", arc_map);
   387   writer.arcMap("arc_map2", arc_map, WriterConverter());
   387   writer.arcMap("arc_map2", arc_map, WriterConverter());
   388   writer.node("node", n2); 
   388   writer.node("node", n2);
   389   writer.edge("edge", e1);
   389   writer.edge("edge", e1);
   390   writer.arc("arc", graph.direct(e1, false));
   390   writer.arc("arc", graph.direct(e1, false));
   391   writer.attribute("attr1", attr);
   391   writer.attribute("attr1", attr);
   392   writer.attribute("attr2", attr, WriterConverter());
   392   writer.attribute("attr2", attr, WriterConverter());
   393 
   393 
   490   writer.edgeMap("edge_map1", edge_map);
   490   writer.edgeMap("edge_map1", edge_map);
   491   writer.edgeMap("edge_map2", edge_map, WriterConverter());
   491   writer.edgeMap("edge_map2", edge_map, WriterConverter());
   492   writer.arcMap("arc_map1", arc_map);
   492   writer.arcMap("arc_map1", arc_map);
   493   writer.arcMap("arc_map2", arc_map, WriterConverter());
   493   writer.arcMap("arc_map2", arc_map, WriterConverter());
   494   writer.node("node", n);
   494   writer.node("node", n);
   495   writer.redNode("red_node", rn1); 
   495   writer.redNode("red_node", rn1);
   496   writer.blueNode("blue_node", bn2);
   496   writer.blueNode("blue_node", bn2);
   497   writer.edge("edge", e1);
   497   writer.edge("edge", e1);
   498   writer.arc("arc", graph.direct(e1, false));
   498   writer.arc("arc", graph.direct(e1, false));
   499   writer.attribute("attr1", attr);
   499   writer.attribute("attr1", attr);
   500   writer.attribute("attr2", attr, WriterConverter());
   500   writer.attribute("attr2", attr, WriterConverter());