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.
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
Hi
using this query with APOC 4.4.0.3
MATCH (p:Clifor )
RETURN p.cliforId, apoc.node.degree.in(p) AS input, apoc.node.degree.out(p) AS output LIMIT 10;
I receive the expected data.
Now I'm trying to set properties but seems not working
MATCH (p:Cli...
Hi all,
I have a graph of invoices issued by companies to other companies I need to understand which are the longest continuous paths, they find GDS algorithms for shortest path but I can't find any for longhest path. Help would be super
Thank you
At...
Hi Gary,
yes it works, looking your suggestion I try this too
MATCH (p:Clifor)
set p.degreeIn = apoc.node.degree.in(p, "FATTURA")
set p.degreeOut = apoc.node.degree.out(p, "FATTURA")
RETURN count(p)
Works fine
Thanks for your help
Rinaldo
