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
Hello rinaldo_bonazzo,
Can you post your question here where our Graph Data Science discussions occur?
https://community.neo4j.com/t5/forums/filteredbylabelpage/board-id/graph_platform/label-name/graph%20algorithmsgraph%20data%20science