Find Cycle (N51ISggz9nVi6Dq8b2gGN)

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_bonazzo

I think this procedure could be useful for you https://neo4j.com/labs/apoc/4.3/overview/apoc.nodes/apoc.nodes.cycles/

1 Like

Thanx @giuseppe_villan
Regards
Rinaldo

Thanks a lot Giuseppe

I started another post about apoc cycle function. It only returns 1 possible cycle for a starting node but I require all cycle path options.