Fix docs

Author: brs96

doc/modules/ROOT/pages/algorithms/all-pairs-shortest-path.adoc

@@ -1,5 +1,3 @@
-:page-aliases: algorithms/all-pairs-shortest-path.adoc
-
 [[algorithm-all-pairs-shortest-path]]
 = All Pairs Shortest Path
 :description: This section describes the All Pairs Shortest Path algorithm in the Neo4j Graph Data Science library.
@@ -77,45 +75,6 @@ include::partial$/algorithms/common-configuration/common-stream-stats-configurat
 
 ======
 
-[.include-with-estimate]
-======
-.The following will estimate the memory requirements for running the algorithm:
-[source, cypher, role=noplay]
-----
-CALL gds.allShortestPaths.stream.estimate(
-  graphNameOrConfiguration: string or map,
-  configuration: map
-)
-YIELD nodeCount, relationshipCount, bytesMin, bytesMax, requiredMemory
-----
-
-include::partial$/algorithms/common-configuration/common-parameters.adoc[]
-
-.Configuration
-[opts="header",cols="3,2,3m,2,8"]
-|===
-| Name          | Type   | Default | Optional | Description
-include::partial$/algorithms/common-configuration/common-estimate-configuration-entries.adoc[]
-| xref:common-usage/running-algos.adoc#common-configuration-relationship-weight-property[relationshipWeightProperty] | String  | null                   | yes      | Name of the relationship property to use as weights. If unspecified, the algorithm runs unweighted.
-|===
-
-.Results
-[opts="header",cols="1,1,6"]
-|===
-| Name                  | Type      | Description
-| nodeCount             | Integer   | The number of nodes in the graph.
-| relationshipCount     | Integer   | The number of relationships in the graph.
-| requiredMemory        | String    | An estimation of the required memory in a human readable format.
-| treeView              | String    | A more detailed representation of the required memory, including estimates of the different components in human readable format.
-| mapView               | Map       | A more detailed representation of the required memory, including estimates of the different components in structured format.
-| bytesMin              | Integer   | The minimum number of bytes required.
-| bytesMax              | Integer   | The maximum number of bytes required.
-| heapPercentageMin     | Float     | The minimum percentage of the configured maximum heap required.
-| heapPercentageMax     | Float     | The maximum percentage of the configured maximum heap required.
-|===
-
-======
-
 [[algorithm-all-pairs-shortest-path-sample]]
 == All Pairs Shortest Path algorithm sample
 
@@ -158,6 +117,39 @@ RETURN gds.graph.project(
 )
 ----
 
+[[algorithm-all-pairs-shortest-path-examples-memory-estimation]]
+=== Memory Estimation
+
+:mode: stream
+include::partial$/algorithms/shared/examples-estimate-intro.adoc[]
+
+[role=query-example]
+--
+.The following will estimate the memory requirements for running the algorithm:
+[source, cypher, role=noplay]
+----
+CALL gds.allShortestPaths.stream.estimate('cypherGraph', {
+  relationshipWeightProperty: 'cost'
+})
+YIELD nodeCount, relationshipCount, bytesMin, bytesMax, requiredMemory
+RETURN nodeCount, relationshipCount, bytesMin, bytesMax, requiredMemory
+----
+
+.Results
+[opts="header"]
+|===
+| nodeCount | relationshipCount | bytesMin | bytesMax | requiredMemory
+| 6         | 18                | 1264     | 1264     | "1264 Bytes"
+|===
+--
+
+[[algorithm-all-pairs-shortest-path-examples-stream]]
+=== Stream
+
+:!stream-details:
+In the `stream` execution mode, the algorithm returns the shortest path distance for each source-target pair.
+This allows us to inspect the results directly or post-process them in Cypher without any side effects.
+
 [role=query-example]
 --
 .The following will run the algorithm, treating the graph as undirected: