equal
deleted
inserted
replaced
42 |
42 |
43 /// This function runs Kruskal's algorithm to find a minimum cost tree. |
43 /// This function runs Kruskal's algorithm to find a minimum cost tree. |
44 /// Due to hard C++ hacking, it accepts various input and output types. |
44 /// Due to hard C++ hacking, it accepts various input and output types. |
45 /// |
45 /// |
46 /// \param g The graph the algorithm runs on. |
46 /// \param g The graph the algorithm runs on. |
47 /// It can be either \ref concept::Graph "directed" or |
47 /// It can be either \ref concepts::Graph "directed" or |
48 /// \ref concept::UGraph "undirected". |
48 /// \ref concepts::UGraph "undirected". |
49 /// If the graph is directed, the algorithm consider it to be |
49 /// If the graph is directed, the algorithm consider it to be |
50 /// undirected by disregarding the direction of the edges. |
50 /// undirected by disregarding the direction of the edges. |
51 /// |
51 /// |
52 /// \param in This object is used to describe the edge costs. It can be one |
52 /// \param in This object is used to describe the edge costs. It can be one |
53 /// of the following choices. |
53 /// of the following choices. |
81 ///\endcode |
81 ///\endcode |
82 /// |
82 /// |
83 /// \return The cost of the found tree. |
83 /// \return The cost of the found tree. |
84 /// |
84 /// |
85 /// \warning If kruskal runs on an |
85 /// \warning If kruskal runs on an |
86 /// \ref lemon::concept::UGraph "undirected graph", be sure that the |
86 /// \ref lemon::concepts::UGraph "undirected graph", be sure that the |
87 /// map storing the tree is also undirected |
87 /// map storing the tree is also undirected |
88 /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the |
88 /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the |
89 /// half of the edges will not be set. |
89 /// half of the edges will not be set. |
90 /// |
90 /// |
91 /// \todo Discuss the case of undirected graphs: In this case the algorithm |
91 /// \todo Discuss the case of undirected graphs: In this case the algorithm |