Doxyfile for documenting glemon's architecture.
1 #include <lemon/grid_graph.h>
2 #include <lemon/graph_adaptor.h>
3 #include <lemon/graph_to_eps.h>
10 using namespace lemon;
14 ifstream in("grid_graph_demo.in");
16 in >> width >> height;
18 in >> start_x >> start_y;
20 in >> stop_x >> stop_y;
22 GridGraph graph(width, height);
23 GridGraph::Node start = graph(start_x - 1, start_y - 1);
24 GridGraph::Node stop = graph(stop_x - 1, stop_y - 1);
25 GridGraph::NodeMap<bool> filter(graph);
27 for (int j = 0; j < height; ++j) {
29 for (int i = 0; i < width; ++i) {
31 filter[graph(i, j)] = (c == '.');
35 typedef NodeSubGraphAdaptor<GridGraph,
36 GridGraph::NodeMap<bool> > FilteredGraph;
38 FilteredGraph filtered(graph, filter);
40 Bfs<FilteredGraph> bfs(filtered);
41 std::cout << "The length of shortest path: " <<
42 bfs.run(start, stop) << std::endl;
44 FilteredGraph::EdgeMap<bool> path(filtered, false);
46 for (GridGraph::Node node = stop;
47 node != start; node = bfs.predNode(node)) {
48 path[bfs.pred(node)] = true;
51 graphToEps(filtered, "grid_graph.eps").scaleToA4().
53 copyright("(C) 2005 LEMON Project").
54 coords(scaleMap(indexMap(graph), 10)).
58 edgeColors(composeMap(ColorSet(), path)).
61 std::cout << "The shortest path is written to grid_graph.eps" << std::endl;