Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.
06-06-2022 08:57 AM - last edited on 09-06-2022 11:02 AM by TrevorS
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.
Solved! Go to Solution.
06-07-2022 01:32 AM
I think this procedure could be useful for you https://neo4j.com/labs/apoc/4.3/overview/apoc.nodes/apoc.nodes.cycles/
06-14-2022 02:26 AM
06-07-2022 01:32 AM
I think this procedure could be useful for you https://neo4j.com/labs/apoc/4.3/overview/apoc.nodes/apoc.nodes.cycles/
06-14-2022 02:26 AM
Thanks a lot Giuseppe
09-03-2022 08:10 AM
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.
All the sessions of the conference are now available online