Update documentation

fslaborg · Nov 17, 2023 · e0904c3 · e0904c3
1 parent 41d16b9
commit e0904c3
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/docs/A_Dijkstra.fsx b/docs/A_Dijkstra.fsx
@@ -80,7 +80,7 @@ vizGraph
 And now, let´s compute the shortest paths via Dijkstra :
 
 *)
-let dij = Algorithms.Dijkstra.compute(0,id,dwg)
+let dij = Algorithms.Dijkstra.compute(0,dwg)
 
 
 (**

diff --git a/docs/M_4_CentralityMeasures.fsx b/docs/M_4_CentralityMeasures.fsx
@@ -83,7 +83,7 @@ Nodes with high closeness centrality are considered central because they are clo
 *)
 
 let closenessCentrality =
-    Measures.ClosenessCentrality.ofAdjGraph id centralityGraph
+    Measures.ClosenessCentrality.computeWithEdgeData centralityGraph
 
 
 renderCyGraph (fun x -> CyParam.label ($"Node: {x};Closeness: {((closenessCentrality.Item x)|>Math.round 3)}"))
@@ -96,7 +96,7 @@ Nodes with high betweenness centrality act as bridges or intermediaries in the n
 *)
 
 let betweenness = 
-    Measures.BetweennessCentrality.ofAdjGraph id centralityGraph
+    Measures.BetweennessCentrality.computeWithEdgeData centralityGraph
 
 renderCyGraph (fun x -> CyParam.label ($"Node: {x};Betweenness: {betweenness.Item x}"))
 (*** include-it-raw ***)
@@ -109,7 +109,7 @@ In other words, it represents the maximum distance between a node and any other
 *)
 
 let eccentricity (node:'NodeKey) =
-    Measures.Eccentricity.ofAdjGraphNode id centralityGraph node
+    Measures.Eccentricity.computeOfNodeWithEdgeData centralityGraph node
 
 renderCyGraph (fun x -> CyParam.label ($"Node: {x};Eccentricity: {eccentricity x}"))
 (*** include-it-raw ***)
-Original file line number
+Diff line change
@@ Expand Up / @@ -80,7 +80,7 @@ vizGraph @@
     And now, let´s compute the shortest paths via Dijkstra :
     *)
-    let dij = Algorithms.Dijkstra.compute(0,id,dwg)
+    let dij = Algorithms.Dijkstra.compute(0,dwg)
     (**
@@ Expand Down @@