I started writing a bunch of stuff, and then re-read your question and realised what i answered wasn't what you were asking, but i'll leave at the bottom regardless.

In the help for the transformer it links to a blog post written by @mark2atsafe​ that should give you some good examples

https://engage.safe.com/blog/2017/09/minimum-spanning-tree-evangelist167/

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

I'm no mathmatician, but from my point of view, a minimum spanning tree is similar to/a sub set of the traveling salesman problem

These problems can get incredibly complex and i'm sure someone on here will have a much better understanding than I do

In terms of a workbench, I don't have one, but i'd imagine you'd need to follow the logic of the Kruskal algortihm, below is a link/guide on implementing it in python

https://www.javatpoint.com/implementation-of-kruskals-algorithm-in-python

https://www.statisticshowto.com/minimum-spanning-tree/

https://en.wikipedia.org/wiki/Travelling_salesman_problem

https://stackoverflow.com/questions/3838747/whats-the-difference-between-minimmum-spanning-tree-and-travelling-salesman-pro

https://chat.openai.com/share/1e5b0de5-da1f-47c7-ac15-843a6369ce00