Jean-Yves Tinevez

@Skirt: Thanks! Unfortunately this class cannot do what you want. What you describe here is a simple graph, of which this tree is just a specialization (this is actually an even more specialized *rooted tree* in a tree, all nodes but the root have exactly one parent, and edges have a direction).

You can make a tree out of a simple undirected graph (simple pick one particular node, and name it "the root"), but I think that you could beneficiate from a proper data structure class for what you want.

There exist some basis on which you could build in MATLAB, using e.g. the adjacency matrix (used in gplot http://www.mathworks.fr/fr/help/matlab/ref/gplot.html) which is an unspecialized sparse matrix.

Best
jy

Hi John,
Again a great submission in a flawless catalogue.
I just have a side question: How would I do to get the interpolated curve we measure the distance to in your contribution? My attempts to approach the implicit curve we compute the distance to here have failed (see fex #22948).
Best
jy

It works well, thanks for uploading