id	summary	reporter	owner	description	type	status	milestone	component	version	severity	resolution	keywords	cc
6401	BGL: new algorithm	michele.caini@…	Jeremiah Willcock	"I would like to submit a new algorithm for inclusion in the Boost Graph Library.
It can be used to search the common spanning trees of two graphs, assuming that the graphs are represented as lists of edges. More details if you are interested.
It is currently used within the software QSapecNG (https://sourceforge.net/projects/qsapecng/).

I request to know what is required for submission in support of the algorithm.

Thanks,
Michele"	Library Submissions	closed	To Be Determined	graph	Boost Development Trunk	Not Applicable	fixed	bgl, mrt