Hi,

I’ve found some time to implement the first version of Cahit Spiral Chains algorithm.

I still need to:

• Find all spiral chains of a given graph and not only one (changing the starting point)
• I need to implement the concept of “nearest unused vertex to the last vertex of the last spiral chain”. This is needed to find the starting point of the next spiral <– DONE

Here is the video on youtube: