Compute the minimum spanning tree for the mesh graph including convex, concave and flat region detection. This uses a modified Kruskal algorithm with weight limits

Inputs

Name	ID	Description	Type
MeshGraph	G	The MGraph object used for MST calculation	Any
Interval	I	Edges weights inside this interval will be considered only. Edges crossing from flat to convex or concave will have their weight incremented with 1.0 and edges passing from concave to convex or the other way around will have their weight incremented with 2.0	Interval

Outputs

Name	ID	Description	Type
MSTGraph	G	The minimum spanning tree/trees MGraph object	Any