# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1216045212 -7200
# Node ID 6d7bfcf5b48effbe6e426d15745a4188d8a2c11d
# Parent 81cfc04531e8fcf0a6e72f22ff2871fcb827c416
Doc improvement for kruskal() (ticket #114)
diff -r 81cfc04531e8 -r 6d7bfcf5b48e lemon/kruskal.h
|
a
|
b
|
|
| 300 | 300 | /// |
| 301 | 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 |
| 304 | | /// Arc type for input and output. |
| 305 | | /// |
| | 303 | /// \note If the input graph is not (weakly) connected, a spanning |
| | 304 | /// forest is calculated instead of a spanning tree. |
| 306 | 305 | |
| 307 | 306 | #ifdef DOXYGEN |
| 308 | 307 | template <class Graph, class In, class Out> |
