I am looking to list all of the triangles in some large graphs from stanford. (one example is the web-Google graph)
It seems that gds.alpha.triangles is exactly what I want, but when I run the algorithm, only about one tenth of the triangles are listed.
Does anyone know why this might be, and how I can list all of the triangles?
-Why is this algorithm only in the alpha stage?
-Isn't triangle enumeration (i.e. listing) needed for calculating things such as the clustering coefficient, or does neo4j use approximation algorithms for calculating such values?