Add colons to the end of each example caption

vnickolov · davidoliverSP2 · vnickolov · commit 9574521fda79 · 2020-02-21T12:32:45.000Z
- Points out that the caption is for the example that follows

Co-authored-by: David Oliver &lt;david.oliver@neo4j.com&gt;
diff --git a/doc/asciidoc/migration-graph-ops.adoc b/doc/asciidoc/migration-graph-ops.adoc
@@ -31,7 +31,7 @@ The most significant change in memory estimation is that in GDS to estimate an o
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Native Projections
+2+| Native Projections:
 |
 [source, cypher]
 ----
@@ -49,7 +49,7 @@ CALL gds.graph.create.estimate(
   'MY_RELATIONSHIP_TYPE'
 )
 ----
-2+| Cypher Projections
+2+| Cypher Projections:
 |
 [source, cypher]
 ----
@@ -101,7 +101,7 @@ CALL gds.graph.create.cypher.estimate(
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Minimal Native Projection
+2+| Minimal Native Projection:
 |
 [source, cypher]
 ----
@@ -120,7 +120,7 @@ CALL gds.graph.create(
   'MY_RELATIONSHIP_TYPE'
 )
 ----
-2+| Native Projection with additional properties
+2+| Native Projection with additional properties:
 |
 [source, cypher]
 ----
@@ -151,7 +151,7 @@ CALL gds.graph.create(
   }
 )
 ----
-2+|[[direction-both-example]]Native Projection with `direction: 'BOTH'`
+2+|[[direction-both-example]]Native Projection with `direction: 'BOTH'`:
 |
 [source, cypher]
 ----
@@ -183,7 +183,7 @@ CALL gds.graph.create(
   }
 )
 ----
-2+| Undirected Native Projection
+2+| Undirected Native Projection:
 |
 [source, cypher]
 ----
@@ -219,7 +219,7 @@ CALL gds.graph.create(
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Basic Cypher queries, defining source and target
+2+| Basic Cypher queries, defining source and target:
 |
 [source, cypher]
 ----
@@ -245,7 +245,7 @@ CALL gds.graph.create.cypher(
    RETURN id(s) AS source, id(t) AS target'
 )
 ----
-2+| With concurrency property and Cypher query with relationship property
+2+| With concurrency property and Cypher query with relationship property:
 |
 [source, cypher]
 ----
@@ -344,7 +344,7 @@ CALL gds.graph.list()
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| View information for a Named graph
+2+| View information for a Named graph:
 |
 [source, cypher]
 ----
@@ -355,7 +355,7 @@ CALL algo.graph.info('myGraph')
 ----
 CALL gds.graph.list('myGraph')
 ----
-2+| Check graph existence
+2+| Check graph existence:
 |
 [source, cypher]
 ----
@@ -366,7 +366,7 @@ CALL algo.graph.info('myGraph') YIELD exists
 ----
 CALL gds.graph.exists('myGraph') YIELD exists
 ----
-2+| View graph statistics
+2+| View graph statistics:
 |
 [source, cypher]
 ----
diff --git a/doc/asciidoc/migration-louvain.adoc b/doc/asciidoc/migration-louvain.adoc
@@ -49,7 +49,7 @@
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+|Minimalistic streaming over named graph
+2+|Minimalistic streaming over named graph:
 |
 [source, cypher]
 ----
@@ -62,7 +62,7 @@ YIELD nodeId, community, communities
 CALL gds.louvain.stream('myGraph')
 YIELD nodeId, communityId, communityIds
 ----
-2+|Streaming over named graph using additional properties - `maxLevels` and `maxIterations`
+2+|Streaming over named graph using additional properties - `maxLevels` and `maxIterations`:
 |
 [source, cypher]
 ----
@@ -87,7 +87,7 @@ CALL gds.louvain.stream(
   }
 )
 ----
-2+| Streaming over named graph with weight property
+2+| Streaming over named graph with weight property:
 |
 [source, cypher]
 ----
@@ -110,7 +110,7 @@ CALL gds.louvain.stream(
   }
 )
 ----
-2+| Minimalistic streaming over anonymous graph
+2+| Minimalistic streaming over anonymous graph:
 |
 [source, cypher]
 ----
@@ -127,7 +127,7 @@ CALL gds.louvain.stream({
   relationshipProjection: 'MY_RELATIONSHIP_TYPE'
 })
 ----
-2+| Streaming over anonymous graph with `REVERSE` relationship projection
+2+| Streaming over anonymous graph with `REVERSE` relationship projection:
 |
 [source, cypher]
 ----
@@ -149,7 +149,7 @@ CALL gds.louvain.stream({
   }
 })
 ----
-2+| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]
+2+| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]:
 |
 [source, cypher]
 ----
@@ -182,7 +182,7 @@ CALL gds.louvain.stream({
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Minimalistic write with just `writeProperty`
+2+| Minimalistic write with just `writeProperty`:
 |
 [source, cypher]
 ----
@@ -225,7 +225,7 @@ RETURN
   cd.p1 AS p1,
   conf.writeProperty AS writeProperty
 ----
-2+| Running in `write` mode over weighted graph
+2+| Running in `write` mode over weighted graph:
 |
 [source, cypher]
 ----
@@ -251,7 +251,7 @@ CALL gds.louvain.write(
   }
 )
 ----
-2+| Memory estimation of the algorithm
+2+| Memory estimation of the algorithm:
 |
 [source, cypher]
 ----
diff --git a/doc/asciidoc/migration-lpa.adoc b/doc/asciidoc/migration-lpa.adoc
@@ -44,7 +44,7 @@
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Streaming over a named graph
+2+| Streaming over a named graph:
 |
 [source, cypher]
 ----
@@ -57,7 +57,7 @@ YIELD nodeId, label
 CALL gds.labelPropagation.stream('myGraph')
 YIELD nodeId, communityId
 ----
-2+| Streaming over a named graph using configuration for iterations and relationship weight property
+2+| Streaming over a named graph using configuration for iterations and relationship weight property:
 |
 [source, cypher]
 ----
@@ -82,7 +82,7 @@ CALL gds.labelPropagation.stream(
   }
 )
 ----
-2+| Streaming over anonymous graph
+2+| Streaming over anonymous graph:
 |
 [source, cypher]
 ----
@@ -99,7 +99,7 @@ CALL gds.labelPropagation.stream({
   relationshipProjection: 'MY_RELATIONSHIP_TYPE'
 })
 ----
-2+| Streaming over anonymous graph using relationship with `REVERSE` projection
+2+| Streaming over anonymous graph using relationship with `REVERSE` projection:
 |
 [source, cypher]
 ----
@@ -121,7 +121,7 @@ CALL gds.labelPropagation.stream({
   }
 })
 ----
-2+| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]
+2+| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]:
 |
 [source, cypher]
 ----
@@ -154,7 +154,7 @@ CALL gds.labelPropagation.stream({
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+|Minimalistic write
+2+|Minimalistic write:
 |
 [source, cypher]
 ----
@@ -191,7 +191,7 @@ RETURN
   cd.p1 AS p1,
   conf.writeProperty AS writeProperty
 ----
-2+|Write using weight properties footnote:lpa-write-weighted[In GA the weightProperty is for Nodes and Relationships while in GDS there are separate properties ]
+2+|Write using weight properties footnote:lpa-write-weighted[In GA the weightProperty is for Nodes and Relationships while in GDS there are separate properties]:
 |
 [source, cypher]
 ----
@@ -218,7 +218,7 @@ CALL gds.labelPropagation.write(
   }
 )
 ----
-2+|Memory estimation of the algorithm
+2+|Memory estimation of the algorithm:
 |
 [source, cypher]
 ----
diff --git a/doc/asciidoc/migration-node-sim.adoc b/doc/asciidoc/migration-node-sim.adoc
@@ -46,7 +46,7 @@
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Minimalistic streaming over named graph
+2+| Minimalistic streaming over named graph:
 |
 [source, cypher]
 ----
@@ -59,7 +59,7 @@ YIELD node1, node2, similarity
 CALL gds.nodeSimilarity.stream('myGraph')
 YIELD node1, node2, similarity
 ----
-2+| Streaming over named graph using `topK` and `similarityCutoff` configuration properties
+2+| Streaming over named graph using `topK` and `similarityCutoff` configuration properties:
 |
 [source, cypher]
 ----
@@ -84,7 +84,7 @@ CALL gds.nodeSimilarity.stream(
   }
 )
 ----
-2+| Streaming over named graph using `bottomK` configuration property
+2+| Streaming over named graph using `bottomK` configuration property:
 |
 [source, cypher]
 ----
@@ -107,7 +107,7 @@ CALL gds.nodeSimilarity.stream(
   }
 )
 ----
-2+| Minimalistic streaming over anonymous graph
+2+| Minimalistic streaming over anonymous graph:
 |
 [source, cypher]
 ----
@@ -124,7 +124,7 @@ CALL gds.nodeSimilarity.stream({
   relationshipProjection: 'MY_RELATIONSHIP_TYPE'
 })
 ----
-2+| Streaming over anonymous graph using `REVERSE` relationship projection
+2+| Streaming over anonymous graph using `REVERSE` relationship projection:
 |
 [source, cypher]
 ----
@@ -146,7 +146,7 @@ CALL gds.nodeSimilarity.stream({
   }
 })
 ----
-2+| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]
+2+| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]:
 |
 [source, cypher]
 ----
@@ -179,7 +179,7 @@ CALL gds.nodeSimilarity.stream({
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+|Minimalistic `write` with `writeRelationshipType` and `writeProperty`
+2+|Minimalistic `write` with `writeRelationshipType` and `writeProperty`:
 |
 [source, cypher]
 ----
@@ -226,7 +226,7 @@ RETURN
   sd.p1 AS p1,
   conf.writeProperty AS writeProperty
 ----
-2+| Memory estimation of the algorithm
+2+| Memory estimation of the algorithm:
 |
 [source, cypher]
 ----
diff --git a/doc/asciidoc/migration-page-rank.adoc b/doc/asciidoc/migration-page-rank.adoc
@@ -42,7 +42,7 @@
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+|Minimalistic stream over named graph
+2+|Minimalistic stream over named graph:
 |
 [source, cypher]
 ----
@@ -55,7 +55,7 @@ YIELD nodeId, score
 CALL gds.pageRank.stream('myGraph')
 YIELD nodeId, score
 ----
-2+| Streaming over named graph with iteration limit
+2+| Streaming over named graph with iteration limit:
 |
 [source, cypher]
 ----
@@ -78,7 +78,7 @@ CALL gds.pageRank.stream(
   }
 )
 ----
-2+| Minimalistic streaming over anonymous graph
+2+| Minimalistic streaming over anonymous graph:
 |
 [source, cypher]
 ----
@@ -95,7 +95,7 @@ CALL gds.pageRank.stream({
   relationshipProjection: 'MY_RELATIONSHIP_TYPE'
 })
 ----
-2+| Streaming over anonymous graph with `REVERSE` relationship projection
+2+| Streaming over anonymous graph with `REVERSE` relationship projection:
 |
 [source, cypher]
 ----
@@ -117,7 +117,7 @@ CALL gds.pageRank.stream({
   }
 })
 ----
-2+| Streaming over anonymous graph with relationship weight property, assigning it a default value in case the property doesn't have value
+2+| Streaming over anonymous graph with relationship weight property, assigning it a default value in case the property doesn't have value:
 |
 [source, cypher]
 ----
@@ -152,7 +152,7 @@ CALL gds.pageRank.stream({
 [opts=header,cols="1a,1a"]
 |===
 |Graph Algorithms v3.5 |Graph Data Science v1.0
-2+| Running `write` mode on named graph
+2+| Running `write` mode on named graph:
 |
 [source, cypher]
 ----
@@ -192,7 +192,7 @@ RETURN
   ranIterations,
   conf.writeProperty AS writeProperty
 ----
-2+| Memory estimation of the algorithm
+2+| Memory estimation of the algorithm:
 |
 [source, cypher]
 ----
diff --git a/doc/asciidoc/migration-wcc.adoc b/doc/asciidoc/migration-wcc.adoc

Original file line number	Diff line number	Diff line change
`@@ -31,7 +31,7 @@ The most significant change in memory estimation is that in GDS to estimate an o`
`31`	`31`	`[opts=header,cols="1a,1a"]`
`32`	`32`	`\|===`
`33`	`33`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`34`		`-2+\| Native Projections`
	`34`	`+2+\| Native Projections:`
`35`	`35`	`\|`
`36`	`36`	`[source, cypher]`
`37`	`37`	`----`
`@@ -49,7 +49,7 @@ CALL gds.graph.create.estimate(`
`49`	`49`	`'MY_RELATIONSHIP_TYPE'`
`50`	`50`	`)`
`51`	`51`	`----`
`52`		`-2+\| Cypher Projections`
	`52`	`+2+\| Cypher Projections:`
`53`	`53`	`\|`
`54`	`54`	`[source, cypher]`
`55`	`55`	`----`
`@@ -101,7 +101,7 @@ CALL gds.graph.create.cypher.estimate(`
`101`	`101`	`[opts=header,cols="1a,1a"]`
`102`	`102`	`\|===`
`103`	`103`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`104`		`-2+\| Minimal Native Projection`
	`104`	`+2+\| Minimal Native Projection:`
`105`	`105`	`\|`
`106`	`106`	`[source, cypher]`
`107`	`107`	`----`
`@@ -120,7 +120,7 @@ CALL gds.graph.create(`
`120`	`120`	`'MY_RELATIONSHIP_TYPE'`
`121`	`121`	`)`
`122`	`122`	`----`
`123`		`-2+\| Native Projection with additional properties`
	`123`	`+2+\| Native Projection with additional properties:`
`124`	`124`	`\|`
`125`	`125`	`[source, cypher]`
`126`	`126`	`----`
`@@ -151,7 +151,7 @@ CALL gds.graph.create(`
`151`	`151`	`}`
`152`	`152`	`)`
`153`	`153`	`----`
`154`		-2+\|[[direction-both-example]]Native Projection with `direction: 'BOTH'`
	`154`	+2+\|[[direction-both-example]]Native Projection with `direction: 'BOTH'`:
`155`	`155`	`\|`
`156`	`156`	`[source, cypher]`
`157`	`157`	`----`
`@@ -183,7 +183,7 @@ CALL gds.graph.create(`
`183`	`183`	`}`
`184`	`184`	`)`
`185`	`185`	`----`
`186`		`-2+\| Undirected Native Projection`
	`186`	`+2+\| Undirected Native Projection:`
`187`	`187`	`\|`
`188`	`188`	`[source, cypher]`
`189`	`189`	`----`
`@@ -219,7 +219,7 @@ CALL gds.graph.create(`
`219`	`219`	`[opts=header,cols="1a,1a"]`
`220`	`220`	`\|===`
`221`	`221`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`222`		`-2+\| Basic Cypher queries, defining source and target`
	`222`	`+2+\| Basic Cypher queries, defining source and target:`
`223`	`223`	`\|`
`224`	`224`	`[source, cypher]`
`225`	`225`	`----`
`@@ -245,7 +245,7 @@ CALL gds.graph.create.cypher(`
`245`	`245`	`RETURN id(s) AS source, id(t) AS target'`
`246`	`246`	`)`
`247`	`247`	`----`
`248`		`-2+\| With concurrency property and Cypher query with relationship property`
	`248`	`+2+\| With concurrency property and Cypher query with relationship property:`
`249`	`249`	`\|`
`250`	`250`	`[source, cypher]`
`251`	`251`	`----`
`@@ -344,7 +344,7 @@ CALL gds.graph.list()`
`344`	`344`	`[opts=header,cols="1a,1a"]`
`345`	`345`	`\|===`
`346`	`346`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`347`		`-2+\| View information for a Named graph`
	`347`	`+2+\| View information for a Named graph:`
`348`	`348`	`\|`
`349`	`349`	`[source, cypher]`
`350`	`350`	`----`
`@@ -355,7 +355,7 @@ CALL algo.graph.info('myGraph')`
`355`	`355`	`----`
`356`	`356`	`CALL gds.graph.list('myGraph')`
`357`	`357`	`----`
`358`		`-2+\| Check graph existence`
	`358`	`+2+\| Check graph existence:`
`359`	`359`	`\|`
`360`	`360`	`[source, cypher]`
`361`	`361`	`----`
`@@ -366,7 +366,7 @@ CALL algo.graph.info('myGraph') YIELD exists`
`366`	`366`	`----`
`367`	`367`	`CALL gds.graph.exists('myGraph') YIELD exists`
`368`	`368`	`----`
`369`		`-2+\| View graph statistics`
	`369`	`+2+\| View graph statistics:`
`370`	`370`	`\|`
`371`	`371`	`[source, cypher]`
`372`	`372`	`----`
Original file line number	Diff line number	Diff line change
`@@ -49,7 +49,7 @@`
`49`	`49`	`[opts=header,cols="1a,1a"]`
`50`	`50`	`\|===`
`51`	`51`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`52`		`-2+\|Minimalistic streaming over named graph`
	`52`	`+2+\|Minimalistic streaming over named graph:`
`53`	`53`	`\|`
`54`	`54`	`[source, cypher]`
`55`	`55`	`----`
`@@ -62,7 +62,7 @@ YIELD nodeId, community, communities`
`62`	`62`	`CALL gds.louvain.stream('myGraph')`
`63`	`63`	`YIELD nodeId, communityId, communityIds`
`64`	`64`	`----`
`65`		-2+\|Streaming over named graph using additional properties - `maxLevels` and `maxIterations`
	`65`	+2+\|Streaming over named graph using additional properties - `maxLevels` and `maxIterations`:
`66`	`66`	`\|`
`67`	`67`	`[source, cypher]`
`68`	`68`	`----`
`@@ -87,7 +87,7 @@ CALL gds.louvain.stream(`
`87`	`87`	`}`
`88`	`88`	`)`
`89`	`89`	`----`
`90`		`-2+\| Streaming over named graph with weight property`
	`90`	`+2+\| Streaming over named graph with weight property:`
`91`	`91`	`\|`
`92`	`92`	`[source, cypher]`
`93`	`93`	`----`
`@@ -110,7 +110,7 @@ CALL gds.louvain.stream(`
`110`	`110`	`}`
`111`	`111`	`)`
`112`	`112`	`----`
`113`		`-2+\| Minimalistic streaming over anonymous graph`
	`113`	`+2+\| Minimalistic streaming over anonymous graph:`
`114`	`114`	`\|`
`115`	`115`	`[source, cypher]`
`116`	`116`	`----`
`@@ -127,7 +127,7 @@ CALL gds.louvain.stream({`
`127`	`127`	`relationshipProjection: 'MY_RELATIONSHIP_TYPE'`
`128`	`128`	`})`
`129`	`129`	`----`
`130`		-2+\| Streaming over anonymous graph with `REVERSE` relationship projection
	`130`	+2+\| Streaming over anonymous graph with `REVERSE` relationship projection:
`131`	`131`	`\|`
`132`	`132`	`[source, cypher]`
`133`	`133`	`----`
`@@ -149,7 +149,7 @@ CALL gds.louvain.stream({`
`149`	`149`	`}`
`150`	`150`	`})`
`151`	`151`	`----`
`152`		`-2+\| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]`
	`152`	`+2+\| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]:`
`153`	`153`	`\|`
`154`	`154`	`[source, cypher]`
`155`	`155`	`----`
`@@ -182,7 +182,7 @@ CALL gds.louvain.stream({`
`182`	`182`	`[opts=header,cols="1a,1a"]`
`183`	`183`	`\|===`
`184`	`184`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`185`		-2+\| Minimalistic write with just `writeProperty`
	`185`	+2+\| Minimalistic write with just `writeProperty`:
`186`	`186`	`\|`
`187`	`187`	`[source, cypher]`
`188`	`188`	`----`
`@@ -225,7 +225,7 @@ RETURN`
`225`	`225`	`cd.p1 AS p1,`
`226`	`226`	`conf.writeProperty AS writeProperty`
`227`	`227`	`----`
`228`		-2+\| Running in `write` mode over weighted graph
	`228`	+2+\| Running in `write` mode over weighted graph:
`229`	`229`	`\|`
`230`	`230`	`[source, cypher]`
`231`	`231`	`----`
`@@ -251,7 +251,7 @@ CALL gds.louvain.write(`
`251`	`251`	`}`
`252`	`252`	`)`
`253`	`253`	`----`
`254`		`-2+\| Memory estimation of the algorithm`
	`254`	`+2+\| Memory estimation of the algorithm:`
`255`	`255`	`\|`
`256`	`256`	`[source, cypher]`
`257`	`257`	`----`
Original file line number	Diff line number	Diff line change
`@@ -44,7 +44,7 @@`
`44`	`44`	`[opts=header,cols="1a,1a"]`
`45`	`45`	`\|===`
`46`	`46`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`47`		`-2+\| Streaming over a named graph`
	`47`	`+2+\| Streaming over a named graph:`
`48`	`48`	`\|`
`49`	`49`	`[source, cypher]`
`50`	`50`	`----`
`@@ -57,7 +57,7 @@ YIELD nodeId, label`
`57`	`57`	`CALL gds.labelPropagation.stream('myGraph')`
`58`	`58`	`YIELD nodeId, communityId`
`59`	`59`	`----`
`60`		`-2+\| Streaming over a named graph using configuration for iterations and relationship weight property`
	`60`	`+2+\| Streaming over a named graph using configuration for iterations and relationship weight property:`
`61`	`61`	`\|`
`62`	`62`	`[source, cypher]`
`63`	`63`	`----`
`@@ -82,7 +82,7 @@ CALL gds.labelPropagation.stream(`
`82`	`82`	`}`
`83`	`83`	`)`
`84`	`84`	`----`
`85`		`-2+\| Streaming over anonymous graph`
	`85`	`+2+\| Streaming over anonymous graph:`
`86`	`86`	`\|`
`87`	`87`	`[source, cypher]`
`88`	`88`	`----`
`@@ -99,7 +99,7 @@ CALL gds.labelPropagation.stream({`
`99`	`99`	`relationshipProjection: 'MY_RELATIONSHIP_TYPE'`
`100`	`100`	`})`
`101`	`101`	`----`
`102`		-2+\| Streaming over anonymous graph using relationship with `REVERSE` projection
	`102`	+2+\| Streaming over anonymous graph using relationship with `REVERSE` projection:
`103`	`103`	`\|`
`104`	`104`	`[source, cypher]`
`105`	`105`	`----`
`@@ -121,7 +121,7 @@ CALL gds.labelPropagation.stream({`
`121`	`121`	`}`
`122`	`122`	`})`
`123`	`123`	`----`
`124`		`-2+\| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]`
	`124`	`+2+\| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]:`
`125`	`125`	`\|`
`126`	`126`	`[source, cypher]`
`127`	`127`	`----`
`@@ -154,7 +154,7 @@ CALL gds.labelPropagation.stream({`
`154`	`154`	`[opts=header,cols="1a,1a"]`
`155`	`155`	`\|===`
`156`	`156`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`157`		`-2+\|Minimalistic write`
	`157`	`+2+\|Minimalistic write:`
`158`	`158`	`\|`
`159`	`159`	`[source, cypher]`
`160`	`160`	`----`
`@@ -191,7 +191,7 @@ RETURN`
`191`	`191`	`cd.p1 AS p1,`
`192`	`192`	`conf.writeProperty AS writeProperty`
`193`	`193`	`----`
`194`		`-2+\|Write using weight properties footnote:lpa-write-weighted[In GA the weightProperty is for Nodes and Relationships while in GDS there are separate properties ]`
	`194`	`+2+\|Write using weight properties footnote:lpa-write-weighted[In GA the weightProperty is for Nodes and Relationships while in GDS there are separate properties]:`
`195`	`195`	`\|`
`196`	`196`	`[source, cypher]`
`197`	`197`	`----`
`@@ -218,7 +218,7 @@ CALL gds.labelPropagation.write(`
`218`	`218`	`}`
`219`	`219`	`)`
`220`	`220`	`----`
`221`		`-2+\|Memory estimation of the algorithm`
	`221`	`+2+\|Memory estimation of the algorithm:`
`222`	`222`	`\|`
`223`	`223`	`[source, cypher]`
`224`	`224`	`----`
Original file line number	Diff line number	Diff line change
`@@ -46,7 +46,7 @@`
`46`	`46`	`[opts=header,cols="1a,1a"]`
`47`	`47`	`\|===`
`48`	`48`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`49`		`-2+\| Minimalistic streaming over named graph`
	`49`	`+2+\| Minimalistic streaming over named graph:`
`50`	`50`	`\|`
`51`	`51`	`[source, cypher]`
`52`	`52`	`----`
`@@ -59,7 +59,7 @@ YIELD node1, node2, similarity`
`59`	`59`	`CALL gds.nodeSimilarity.stream('myGraph')`
`60`	`60`	`YIELD node1, node2, similarity`
`61`	`61`	`----`
`62`		-2+\| Streaming over named graph using `topK` and `similarityCutoff` configuration properties
	`62`	+2+\| Streaming over named graph using `topK` and `similarityCutoff` configuration properties:
`63`	`63`	`\|`
`64`	`64`	`[source, cypher]`
`65`	`65`	`----`
`@@ -84,7 +84,7 @@ CALL gds.nodeSimilarity.stream(`
`84`	`84`	`}`
`85`	`85`	`)`
`86`	`86`	`----`
`87`		-2+\| Streaming over named graph using `bottomK` configuration property
	`87`	+2+\| Streaming over named graph using `bottomK` configuration property:
`88`	`88`	`\|`
`89`	`89`	`[source, cypher]`
`90`	`90`	`----`
`@@ -107,7 +107,7 @@ CALL gds.nodeSimilarity.stream(`
`107`	`107`	`}`
`108`	`108`	`)`
`109`	`109`	`----`
`110`		`-2+\| Minimalistic streaming over anonymous graph`
	`110`	`+2+\| Minimalistic streaming over anonymous graph:`
`111`	`111`	`\|`
`112`	`112`	`[source, cypher]`
`113`	`113`	`----`
`@@ -124,7 +124,7 @@ CALL gds.nodeSimilarity.stream({`
`124`	`124`	`relationshipProjection: 'MY_RELATIONSHIP_TYPE'`
`125`	`125`	`})`
`126`	`126`	`----`
`127`		-2+\| Streaming over anonymous graph using `REVERSE` relationship projection
	`127`	+2+\| Streaming over anonymous graph using `REVERSE` relationship projection:
`128`	`128`	`\|`
`129`	`129`	`[source, cypher]`
`130`	`130`	`----`
`@@ -146,7 +146,7 @@ CALL gds.nodeSimilarity.stream({`
`146`	`146`	`}`
`147`	`147`	`})`
`148`	`148`	`----`
`149`		`-2+\| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]`
	`149`	`+2+\| Streaming over anonymous graph using two way relationships footnote:[Not algorithm specific. This is also possible with named graphs. The graph has to be created with two relationship projections - one for each direction]:`
`150`	`150`	`\|`
`151`	`151`	`[source, cypher]`
`152`	`152`	`----`
`@@ -179,7 +179,7 @@ CALL gds.nodeSimilarity.stream({`
`179`	`179`	`[opts=header,cols="1a,1a"]`
`180`	`180`	`\|===`
`181`	`181`	`\|Graph Algorithms v3.5 \|Graph Data Science v1.0`
`182`		-2+\|Minimalistic `write` with `writeRelationshipType` and `writeProperty`
	`182`	+2+\|Minimalistic `write` with `writeRelationshipType` and `writeProperty`:
`183`	`183`	`\|`
`184`	`184`	`[source, cypher]`
`185`	`185`	`----`
`@@ -226,7 +226,7 @@ RETURN`
`226`	`226`	`sd.p1 AS p1,`
`227`	`227`	`conf.writeProperty AS writeProperty`
`228`	`228`	`----`
`229`		`-2+\| Memory estimation of the algorithm`
	`229`	`+2+\| Memory estimation of the algorithm:`
`230`	`230`	`\|`
`231`	`231`	`[source, cypher]`
`232`	`232`	`----`