Circle Algorithm
Hy community,I am looking for a method (algorithm, APOC, ...) that allows me to find the greatest number of cycles within a connected graph.Looking to Dijkstra, K coloring, ...Any suggestions, please?Thank you have a nice week end.Rinaldo
