Update random walk docs to beta

Author: DarthMax

doc/antora/content-nav.adoc

@@ -80,7 +80,7 @@
 *** xref:alpha-algorithms/minimum-weight-spanning-tree/index.adoc[]
 *** xref:alpha-algorithms/single-source-shortest-path/index.adoc[]
 *** xref:alpha-algorithms/all-pairs-shortest-path/index.adoc[]
-*** xref:alpha-algorithms/random-walk/index.adoc[]
+*** xref:beta-algorithms/random-walk/index.adoc[]
 *** xref:algorithms/bfs/index.adoc[]
 *** xref:algorithms/dfs/index.adoc[]
 ** xref:algorithms/linkprediction/index.adoc[]

doc/asciidoc/algorithms/algorithms-path-finding.adoc

@@ -14,11 +14,12 @@ The Neo4j GDS library includes the following path finding algorithms, grouped by
 ** <<algorithms-dijkstra-single-source, Dijkstra Single-Source>>
 ** <<algorithms-astar, A*>>
 ** <<algorithms-yens, Yen's algorithm>>
+* Beta
+** <<beta-algorithms-random-walk, Random Walk>>
 * Alpha
 ** <<alpha-algorithms-minimum-weight-spanning-tree, Minimum Weight Spanning Tree>>
 ** <<alpha-algorithms-single-source-shortest-path, Single Source Shortest Path>>
 ** <<alpha-algorithm-all-pairs-shortest-path, All Pairs Shortest Path>>
-** <<alpha-algorithms-random-walk, Random Walk>>
 ** <<algorithms-bfs, Breadth First Search>>
 ** <<algorithms-dfs, Depth First Search>>
 
@@ -30,14 +31,14 @@ include::shortest-path/astar.adoc[leveloffset=+1]
 
 include::shortest-path/yens.adoc[leveloffset=+1]
 
+include::beta/randomWalk/beta-random-walk.adoc[leveloffset=+1]
+
 include::alpha/alpha-minimum-weight-spanning-tree.adoc[leveloffset=+1]
 
 include::alpha/alpha-single-shortest-path.adoc[leveloffset=+1]
 
 include::alpha/alpha-all-pairs-shortest-path.adoc[leveloffset=+1]
 
-include::alpha/randomWalk/alpha-random-walk.adoc[leveloffset=+1]
-
 include::alpha/alpha-bfs.adoc[leveloffset=+1]
 
 include::alpha/alpha-dfs.adoc[leveloffset=+1]

doc/asciidoc/algorithms/alpha/randomWalk/alpha-random-walk.adoc renamed to doc/asciidoc/algorithms/beta/randomWalk/beta-random-walk.adoc

@@ -1,5 +1,5 @@
-[[alpha-algorithms-random-walk]]
-[.alpha]
+[[beta-algorithms-random-walk]]
+[.beta]
 = Random Walk
 
 [abstract]
@@ -27,6 +27,12 @@ A relationship property value greater than 1 will increase the likelihood of a r
 [NOTE]
 To obtain a random walk where the transition probability is independent of the previously visited nodes both the `returnFactor` and the `inOutFactor` can be set to 1.0.
 
+[NOTE]
+====
+Running this algorithm requires sufficient memory availability.
+Before running this algorithm, we recommend that you read <<memory-estimation>>.
+====
+
 [[algorithms-random-walk-syntax]]
 == Syntax
 
@@ -39,7 +45,7 @@ To obtain a random walk where the transition probability is independent of the p
 .Run RandomWalk in stream mode on a named graph.
 [source, cypher, role=noplay]
 ----
-CALL gds.alpha.randomWalk.stream(
+CALL gds.beta.randomWalk.stream(
   graphName: String,
   configuration: Map
 ) YIELD
@@ -111,7 +117,7 @@ CALL gds.graph.create(
 .Run the RandomWalk algorithm on `myGraph`
 [source, cypher, role=noplay]
 ----
-CALL gds.alpha.randomWalk.stream(
+CALL gds.beta.randomWalk.stream(
   'myGraph',
   {
     walkLength: 3,
@@ -147,7 +153,7 @@ RETURN nodeIds, [node IN nodes(path) | node.name ] AS pages
 MATCH (page:Page)
 WHERE page.name IN ['Home', 'About']
 WITH COLLECT(page) as sourceNodes
-CALL gds.alpha.randomWalk.stream(
+CALL gds.beta.randomWalk.stream(
   'myGraph',
   {
     sourceNodes: sourceNodes,

doc/asciidoc/algorithms/alpha/randomWalk/specific-configuration.adoc renamed to doc/asciidoc/algorithms/beta/randomWalk/specific-configuration.adoc

@@ -201,6 +201,9 @@ include::../algorithms/algorithm-tiers.adoc[]
 | `gds.beta.node2vec.stream.estimate`
 | `gds.beta.node2vec.write`
 | `gds.beta.node2vec.write`.estimate
+.2+<.^|<<beta-algorithms-random-walk, Random Walk>>
+| `gds.beta.randomWalk.stream`
+| `gds.beta.randomWalk.stream.estimate`
 |===
 
 [[alpha-tier]]
@@ -239,8 +242,6 @@ include::../algorithms/algorithm-tiers.adoc[]
 | `gds.alpha.hits.stream.estimate`
 | `gds.alpha.hits.write`
 | `gds.alpha.hits.write.estimate`
-.1+<.^|<<alpha-algorithms-random-walk, Random Walk>>
-| `gds.alpha.randomWalk.stream`
 .2+<.^|<<algorithms-strongly-connected-components, Strongly Connected Components>>
 | `gds.alpha.scc.stream`
 | `gds.alpha.scc.write`

doc/asciidoc/operations-reference/appendix-a-graph-algos.adoc

@@ -239,8 +239,8 @@
             <d:tocentry linkend="alpha-algorithm-all-pairs-shortest-path">
                 <?dbhtml filename="alpha-algorithms/all-pairs-shortest-path/index.html"?>
             </d:tocentry>
-            <d:tocentry linkend="alpha-algorithms-random-walk">
-                <?dbhtml filename="alpha-algorithms/random-walk/index.html"?>
+            <d:tocentry linkend="beta-algorithms-random-walk">
+                <?dbhtml filename="beta-algorithms/random-walk/index.html"?>
             </d:tocentry>
             <d:tocentry linkend="algorithms-bfs">
                 <?dbhtml filename="algorithms/bfs/index.html"?>

doc/docbook/content-map.xml

@@ -19,8 +19,8 @@
  */
 package org.neo4j.gds.doc;
 
+import org.neo4j.gds.beta.randomwalk.RandomWalkStreamProc;
 import org.neo4j.gds.catalog.GraphCreateProc;
-import org.neo4j.gds.walking.RandomWalkStreamProc;
 
 import java.util.List;