fix dijkstra pathcount overflow (#980)

sbromberger · Aug 10, 2018 · 3b75ff7 · 3b75ff7
1 parent 6f019a2
commit 3b75ff7
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/src/shortestpaths/dijkstra.jl b/src/shortestpaths/dijkstra.jl
@@ -7,7 +7,7 @@ struct DijkstraState{T <: Real,U <: Integer} <: AbstractPathState
     parents::Vector{U}
     dists::Vector{T}
     predecessors::Vector{Vector{U}}
-    pathcounts::Vector{U}
+    pathcounts::Vector{UInt64}
     closest_vertices::Vector{U}
 end
 
@@ -40,7 +40,7 @@ function dijkstra_shortest_paths(g::AbstractGraph,
     parents = zeros(U, nvg)
     visited = zeros(Bool, nvg)
 
-    pathcounts = zeros(Int, nvg)
+    pathcounts = zeros(UInt64, nvg)
     preds = fill(Vector{U}(), nvg)
     H = PriorityQueue{U,T}()
     # fill creates only one array.