DOC-3042: Update note on outdegree() function for clarity [3.6]

Clarified the note on outdegree() function to explain performance and potential outdated values due to concurrent write transactions.

Author: Tushar-TG-14

modules/querying/pages/func/vertex-methods.adoc

@@ -309,10 +309,10 @@ Returns the number of outgoing or undirected edges connected to the vertex. If e
 |===
 
 [CAUTION]
-[discrete]
 ==== 
-*Note on outdegree()*: This function reads a metadata value stored with each vertex, to avoid traversing the graph and thus have a fast response. The snapshot transaction semantics means that outdegree() may sometimes read an old value if there are concurrent write transactions. To guarantee an accurate count, traverse the neighboring edges and count them with a SumAccum, or use a function like neighbors() and then use size() on the set.
-[discrete]
+*Note on outdegree()*: The outdegree() function reads a stored metadata value for faster performance instead of traversing the graph.
+Because of snapshot transaction semantics, `outdegree()` might show an outdated value if there are *write transactions running or have just finished*. This delay happens because the background rebuild task may not have processed the updates yet.
+To get an exact count, traverse the edges manually using a `SumAccum`, or use the `neighbors()` function and apply `size()` on the result.
 ==== 
 
 === `setAttr()`