We have now provided a function named has_cyclic to detect if a SWC tree contains a cycle. Going further, we can offer a method to detect the cyclic points. Assuming this is a directed graph, and we start from a point (the root of the tree), then we can definitely find the points where paths overlap.
We have now provided a function named
has_cyclicto detect if a SWC tree contains a cycle. Going further, we can offer a method to detect the cyclic points. Assuming this is a directed graph, and we start from a point (the root of the tree), then we can definitely find the points where paths overlap.