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::StaticGraph "directed" or |
47 /// It can be either \ref concept::Graph "directed" or |
48 /// \ref concept::UGraph "undirected". |
48 /// \ref concept::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 |