diff -r a34203867181 -r 269f0cbfbcc8 demo/grid_graph_demo.cc
--- a/demo/grid_graph_demo.cc	Fri Sep 30 13:13:42 2005 +0000
+++ b/demo/grid_graph_demo.cc	Fri Sep 30 13:15:28 2005 +0000
@@ -41,28 +41,21 @@
   std::cout << "The length of shortest path: " << 
     bfs.run(start, stop) << std::endl;
 
-  GridGraph::NodeMap<xy<double> > coord(graph);
-  for (int i = 0; i < graph.width(); ++i) {
-    for (int j = 0; j < graph.height(); ++j) {
-      coord[graph(i, j)] = xy<double>( i * 10.0, j * 10.0);
-    }
-  }
-  
-  FilteredGraph::EdgeMap<Color> color(filtered, Color(0.0, 0.0, 0.0));
+  FilteredGraph::EdgeMap<bool> path(filtered, false);
   
   for (GridGraph::Node node = stop; 
        node != start; node = bfs.predNode(node)) {
-    color[bfs.pred(node)] = Color(1.0, 0.0, 0.0);
+    path[bfs.pred(node)] = true;
   }
   
   graphToEps(filtered, "grid_graph.eps").scaleToA4().
     title("Grid graph").
     copyright("(C) 2005 LEMON Project").
-    coords(coord).
+    coords(scaleMap(indexMap(graph), 10)).
     enableParallel().
-    nodeScale(.45).
+    nodeScale(0.5).
     drawArrows().
-    edgeColors(color).
+    edgeColors(composeMap(ColorSet(), path)).
     run();
   
   std::cout << "The shortest path is written to grid_graph.eps" << std::endl;