equal
deleted
inserted
replaced
43 /// @{ |
43 /// @{ |
44 |
44 |
45 /// Kruskal's algorithm to find a minimum cost tree of a graph. |
45 /// Kruskal's algorithm to find a minimum cost tree of a graph. |
46 |
46 |
47 /// This function runs Kruskal's algorithm to find a minimum cost tree. |
47 /// This function runs Kruskal's algorithm to find a minimum cost tree. |
48 /// \param g The graph the algorithm runs on. The algorithm considers the |
48 /// \param g The graph the algorithm runs on. |
49 /// graph to be undirected, the direction of the edges are not used. |
49 /// It can be either \ref concept::StaticGraph "directed" or |
|
50 /// \ref concept::UndirStaticGraph "undirected". |
|
51 /// If the graph is directed, the algorithm consider it to be |
|
52 /// undirected by disregarding the direction of the edges. |
50 /// |
53 /// |
51 /// \param in This object is used to describe the edge costs. It must |
54 /// \param in This object is used to describe the edge costs. It must |
52 /// be an STL compatible 'Forward Container' |
55 /// be an STL compatible 'Forward Container' |
53 /// with <tt>std::pair<GR::Edge,X></tt> as its <tt>value_type</tt>, |
56 /// with <tt>std::pair<GR::Edge,X></tt> as its <tt>value_type</tt>, |
54 /// where X is the type of the costs. It must contain every edge in |
57 /// where X is the type of the costs. It must contain every edge in |