This is the first of a number of messages.

Some of you may not have seen the greedy path by edge length. It sorts the edges by length and then includes them in the path as long as an edge does not connect to a node that is already in the path.

To watch it: https://drive.google.com/drive/folders/1mHSDhD4QIzMKPqwSOSWf5b04VWGuq71G?usp=sharing .

The linked folder has a number of sample paths.