@@ -18,6 +18,9 @@ This topic includes:
18
18
** <<algorithms-louvain-examples-stream-weighted, Weights>>
19
19
** <<algorithms-louvain-examples-stream-seeded, Seeding>>
20
20
** <<algorithms-louvain-examples-stream-intermediate, Multi-Level>>
21
+ ** <<algorithms-louvain-examples-memory-estimation, Memory Estimation>>
22
+ ** <<algorithms-louvain-examples-stats, Stats>>
23
+
21
24
22
25
[[algorithms-louvain-intro]]
23
26
== Introduction
@@ -559,3 +562,44 @@ ORDER BY name ASC
559
562
--
560
563
561
564
In this example graph, after the first iteration we see 4 clusters, which in the second iteration are reduced to three.
565
+
566
+
567
+ [[algorithms-louvain-examples-memory-estimation]]
568
+ === Memory Estimation
569
+
570
+ [role=query-example]
571
+ --
572
+ .The following will estimate the memory requirements for running the algorithm:
573
+ [source, cypher]
574
+ ----
575
+ CALL gds.louvain.write.estimate('myGraph', { writeProperty: 'community' })
576
+ YIELD nodeCount, relationshipCount, bytesMin, bytesMax, requiredMemory
577
+ ----
578
+
579
+ .Results
580
+ [opts="header", cols="1,1,1,1,1"]
581
+ |===
582
+ | nodeCount | relationshipCount | bytesMin | bytesMax | requiredMemory
583
+ | 6 | 7 | 5361 | 580408 | "[5361 Bytes \... 566 KiB]"
584
+ |===
585
+ --
586
+
587
+ [[algorithms-louvain-examples-stats]]
588
+ === Stats
589
+
590
+ [role=query-example]
591
+ --
592
+ .The following will run the algorithm and returns the result in form of statistical and measurement values
593
+ [source, cypher]
594
+ ----
595
+ CALL gds.louvain.stats('myGraph')
596
+ YIELD communityCount
597
+ ----
598
+
599
+ .Results
600
+ [opts="header",cols="1"]
601
+ |===
602
+ | communityCount
603
+ | 2
604
+ |===
605
+ --
0 commit comments