id	summary	reporter	owner	description	type	status	priority	milestone	component	version	resolution	keywords	cc	revision
114	Revise the documentation of kruskal()	Peter Kovacs	Alpar Juttner	"The attached patch file contains doc improvements for {{{kruskal()}}}, but there are two more things that should be revised.
 1. If the input graph is not connected (or the input digraph is not weakly connected), a spanning forest is calculated instead of a spanning tree. Am I right? I think, there should be a {{{\note}}} in the doc about this important case.
 2. The {{{\warning}}} seems to be meaningless. Perhaps a word is missing after ""If Kruskal runs on an"".
"	enhancement	closed	major	LEMON 1.0 release	documentation	hg main	fixed