Changeset 1641:77f6ab7ad66f in lemon-0.x for demo/dijkstra_demo.cc

Timestamp:

08/18/05 00:07:35 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2154

Message:

Demos' documentations include the source.

File:

• demo/dijkstra_demo.cc (modified) (3 diffs)

demo/dijkstra_demo.cc

@@ -23 +23 @@
 /// facilities supplied by our implementation: for the detailed
 /// documentation of the LEMON Dijkstra class read \ref lemon::Dijkstra "this".
+///
+/// \include dijkstra_demo.cc
 
 #include <iostream>
@@ -28 +30 @@
 #include <lemon/list_graph.h>
 #include <lemon/dijkstra.h>
-//#include <lemon/graph_writer.h>
 
 using namespace lemon;
@@ -70 +71 @@
     len.set(v5_t, 8);
 
-    std::cout << "This program is a simple demo of the LEMON Dijkstra class."<<std::endl;
-    std::cout << "We calculate the shortest path from node s to node t in a graph."<<std::endl;
-    std::cout <<std::endl;
+    std::cout << "This program is a simple demo of the LEMON Dijkstra class."
+              << std::endl;
+    std::cout <<
+      "We calculate the shortest path from node s to node t in a graph."
+              << std::endl;
+    std::cout << std::endl;
 
 
-    std::cout << "The id of s is " << g.id(s)<< ", the id of t is " << g.id(t)<<"."<<std::endl;
+    std::cout << "The id of s is " << g.id(s)<< ", the id of t is "
+              << g.id(t) << "." << std::endl;
 
     std::cout << "Dijkstra algorithm demo..." << std::endl;
-
 
     Dijkstra<Graph, LengthMap> dijkstra_test(g,len);
     
     dijkstra_test.run(s);
+    
+    std::cout << "The distance of node t from node s: "
+              << dijkstra_test.dist(t) << std::endl;
 
+    std::cout << "The shortest path from s to t goes through the following "
+              << "nodes (the first one is t, the last one is s): "
+              << std::endl;
+
+    for (Node v=t;v != s; v=dijkstra_test.predNode(v)) {
+      std::cout << g.id(v) << "<-";
+    }
     
-    std::cout << "The distance of node t from node s: " << dijkstra_test.dist(t)<<std::endl;
-
-    std::cout << "The shortest path from s to t goes through the following nodes (the first one is t, the last one is s): "<<std::endl;
-
-    for (Node v=t;v != s; v=dijkstra_test.predNode(v)){
-        std::cout << g.id(v) << "<-";
-    }
     std::cout << g.id(s) << std::endl;  
     
-
     return 0;
 }
-
-
-
-
-
-
-
-
-