demo/disjoint_paths_demo.cc
changeset 2334 c1e936e6a46b
parent 2174 f9e43b5cc617
child 2391 14a343be7a5a
equal deleted inserted replaced
1:6ce8d1468eb9 2:c44bc44e9d8c
    50   cout << "The graph is read from the disjoint_paths_demo.lgf file" << endl;
    50   cout << "The graph is read from the disjoint_paths_demo.lgf file" << endl;
    51   typedef SmartGraph Graph;
    51   typedef SmartGraph Graph;
    52 
    52 
    53   Graph graph;
    53   Graph graph;
    54 
    54 
    55   Graph::NodeMap<xy<double> > coords(graph);
    55   Graph::NodeMap<dim2::Point<double> > coords(graph);
    56   Graph::Node source, target;
    56   Graph::Node source, target;
    57   GraphReader<Graph>("disjoint_paths_demo.lgf", graph).
    57   GraphReader<Graph>("disjoint_paths_demo.lgf", graph).
    58     readNodeMap("coords", coords).
    58     readNodeMap("coords", coords).
    59     readNode("source", source).readNode("target", target).run();
    59     readNode("source", source).readNode("target", target).run();
    60 
    60 
    96 
    96 
    97 
    97 
    98   graphToEps(sgraph, "node_disjoint_paths.eps").
    98   graphToEps(sgraph, "node_disjoint_paths.eps").
    99     title("node disjoint path").copyright("(C) 2006 LEMON Project").drawArrows().
    99     title("node disjoint path").copyright("(C) 2006 LEMON Project").drawArrows().
   100     edgeColors(composeMap(functorMap(color), sflow)).
   100     edgeColors(composeMap(functorMap(color), sflow)).
   101     coords(SGraph::combinedNodeMap(coords, shiftMap(coords, xy<double>(5, 0)))).
   101     coords(SGraph::combinedNodeMap(coords,
       
   102 				   shiftMap(coords,
       
   103 					    dim2::Point<double>(5, 0)))).
   102     autoNodeScale().run();
   104     autoNodeScale().run();
   103 
   105 
   104   cout << "The paths are written into node_disjoint_paths.eps" << endl;
   106   cout << "The paths are written into node_disjoint_paths.eps" << endl;
   105   
   107   
   106   return 0;
   108   return 0;