Can you describe the end result you are looking for? Or provide a sketch?

Are you looking for a situation where all points are part of one network, in which every point is connected directly to 2 other points (except for 2 end points, that are only connected directly to one other point)?

Or are you looking for a tree structure? Or something else?

@geomancer​ 

I am looking for all points ,that connects together

as example

in case point connect with 2 point

point a connect with point b

point a connect with point d

in case point connect with one point

point b connect with point e

in case the point connect in 3 direction

point e connect with point f

Point e connect with point g

point e connect with point k

all point above find the next neighbor

I need to extract this information

what is the neighbor point of each base point ?

u could say ,that I am looking for tree structure .

but in case i started from point a

and one point later connects with point a so i do not need it to look for more at this direction Bcs k have found the points from point a before

If you are looking for something like a Minimum Spanning Tree, it looks like there is no simple solution in FME. This article uses FME and R.

Edit: For ideas for a Steiner Tree see this article using FME and Python.

Thank you, you saved my day.

I am looking for a tree structure ,how could I start ?which ideas should I follow ?

Please see my reply from July 4.