Hello!
I am doing a reasearch on networks in natural materials which consist of polygons with diffrent number of sides. Is there a way to find rings by
BreadthFirstScan
function? Assume that I have the following graph:
which
{1,2,3,4,5,6}
{3,4,11,12,13}
{3,7,8,9,10,11}
are rings of this network.