update wording based on conversation in PR

IbrH · Sep 25, 2023 · d49ea2e · d49ea2e
1 parent 46e9a7c
commit d49ea2e
Showing 1 changed file with 4 additions and 5 deletions.
diff --git a/networkx/algorithms/centrality/betweenness.py b/networkx/algorithms/centrality/betweenness.py
@@ -99,11 +99,10 @@ def betweenness_centrality(
     then we are only counting the paths in one direction. They are
     undirected paths but we are counting them in a directed way.
     To count them as undirected paths, each should count as half a path.
-    
-    This algorithm is not guaranteed to work if edge weights or demands
-    are floating point numbers (overflows and roundoff errors can
-    cause problems). As a workaround you can use integer numbers by
-    multiplying the relevant edge attributes by a convenient
+
+    This algorithm is not guaranteed to be correct if edge weights
+    are floating point numbers. As a workaround you can use integer
+    numbers by multiplying the relevant edge attributes by a convenient
     constant factor (eg 100) and converting to integers.
 
     References