equal
deleted
inserted
replaced
49 /// This function runs Kruskal's algorithm to find a minimum cost tree. |
49 /// This function runs Kruskal's algorithm to find a minimum cost tree. |
50 /// Due to hard C++ hacking, it accepts various input and output types. |
50 /// Due to hard C++ hacking, it accepts various input and output types. |
51 /// |
51 /// |
52 /// \param g The graph the algorithm runs on. |
52 /// \param g The graph the algorithm runs on. |
53 /// It can be either \ref concept::StaticGraph "directed" or |
53 /// It can be either \ref concept::StaticGraph "directed" or |
54 /// \ref concept::UndirStaticGraph "undirected". |
54 /// \ref concept::UndirGraph "undirected". |
55 /// If the graph is directed, the algorithm consider it to be |
55 /// If the graph is directed, the algorithm consider it to be |
56 /// undirected by disregarding the direction of the edges. |
56 /// undirected by disregarding the direction of the edges. |
57 /// |
57 /// |
58 /// \param in This object is used to describe the edge costs. It can be one |
58 /// \param in This object is used to describe the edge costs. It can be one |
59 /// of the following choices. |
59 /// of the following choices. |
86 /// kruskal(g,cost,std::back_inserter(tree)); |
86 /// kruskal(g,cost,std::back_inserter(tree)); |
87 /// \endcode |
87 /// \endcode |
88 /// |
88 /// |
89 /// \return The cost of the found tree. |
89 /// \return The cost of the found tree. |
90 /// |
90 /// |
91 /// \warning If kruskal is run on an \ref undirected graph, be sure that the |
91 /// \warning If kruskal is run on an |
|
92 /// \ref lemon::concept::UndirGraph "undirected graph", be sure that the |
92 /// map storing the tree is also undirected |
93 /// map storing the tree is also undirected |
93 /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the |
94 /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the |
94 /// half of the edges will not be set. |
95 /// half of the edges will not be set. |
95 /// |
96 /// |
96 /// \todo Discuss the case of undirected graphs: In this case the algorithm |
97 /// \todo Discuss the case of undirected graphs: In this case the algorithm |