Changeset 50:72867897fcba in lemon-tutorial for undir_graphs.dox

Timestamp:

02/22/10 13:00:14 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Minor improvements

File:

• undir_graphs.dox (modified) (3 diffs)

undir_graphs.dox

@@ -132 +132 @@
 [SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorihtms
 
+\todo This subsection is under construction.
+
 If you would like to design an electric network minimizing the total length
 of wires, then you might be looking for a minimum spanning tree in an
@@ -139 +141 @@
 Let us suppose that the network is stored in a \ref ListGraph object \c g
 with a cost map \c cost. We create a \c bool valued edge map \c tree_map or
-a vector \c tree_vector for stroing the tree that is found by the algorithm.
+a vector \c tree_vector for storing the tree that is found by the algorithm.
 After that, we could call the \ref kruskal() function. It gives back the weight
 of the minimum spanning tree and \c tree_map or \c tree_vector
@@ -168 +170 @@
   std::vector<ListGraph::Edge> tree_vector;
   std::cout << "The weight of the minimum spanning tree is "
-            << kruskal(g, cost_map, tree_vector) << std::endl;
+            << kruskal(g, cost_map, std::back_inserter(tree_vector))
+            << std::endl;
 
   // Print the results