Changeset 1641:77f6ab7ad66f in lemon-0.x for demo/kruskal_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/kruskal_demo.cc (modified) (2 diffs)

demo/kruskal_demo.cc

@@ -21 +21 @@
 /// This demo program shows how to find a minimum weight spanning tree
 /// in a graph by using the Kruskal algorithm. 
+///
+/// \include kruskal_demo.cc
 
 #include <iostream>
@@ -124 +126 @@
     std::cout << g.id(tree_edge_vec[i]) << ";" ;
   std::cout << std::endl;
-  std::cout << "The size of the tree again is: "<< tree_edge_vec.size()<< std::endl; 
+  std::cout << "The size of the tree again is: "<< tree_edge_vec.size()
+            << std::endl;