equal
deleted
inserted
replaced
298 /// kruskal(g,cost,std::back_inserter(tree)); |
298 /// kruskal(g,cost,std::back_inserter(tree)); |
299 ///\endcode |
299 ///\endcode |
300 /// |
300 /// |
301 /// \return The total cost of the found spanning tree. |
301 /// \return The total cost of the found spanning tree. |
302 /// |
302 /// |
303 /// \warning If Kruskal runs on an be consistent of using the same |
303 /// \note If the input graph is not (weakly) connected, a spanning |
304 /// Arc type for input and output. |
304 /// forest is calculated instead of a spanning tree. |
305 /// |
|
306 |
305 |
307 #ifdef DOXYGEN |
306 #ifdef DOXYGEN |
308 template <class Graph, class In, class Out> |
307 template <class Graph, class In, class Out> |
309 Value kruskal(GR const& g, const In& in, Out& out) |
308 Value kruskal(GR const& g, const In& in, Out& out) |
310 #else |
309 #else |