avoid use of internal fields (changes .mutable to ismutable)

Author: etiennedeg

src/Experimental/ShortestPaths/johnson.jl

@@ -25,15 +25,15 @@ function shortest_paths(g::AbstractGraph{U}, distmx::AbstractMatrix{T}, ::Johnso
     type_distmx = typeof(distmx)
     #Change when parallel implementation of Bellman Ford available
     wt_transform = Graphs.Experimental.ShortestPaths.dists(shortest_paths(g, vertices(g), distmx, BellmanFord()))
-    
-    if !type_distmx.mutable && type_distmx !=  Graphs.DefaultDistance
+
+    if !ismutable(type_distmx) && type_distmx !=  Graphs.DefaultDistance
         distmx = sparse(distmx) #Change reference, not value
     end
 
     #Weight transform not needed if all weights are positive.
     if type_distmx !=  Graphs.DefaultDistance
         for e in edges(g)
-            distmx[src(e), dst(e)] += wt_transform[src(e)] - wt_transform[dst(e)] 
+            distmx[src(e), dst(e)] += wt_transform[src(e)] - wt_transform[dst(e)]
         end
     end
 
@@ -51,7 +51,7 @@ function shortest_paths(g::AbstractGraph{U}, distmx::AbstractMatrix{T}, ::Johnso
         dists[:, v] .+= wt_transform[v] #Vertical traversal prefered
     end
 
-    if type_distmx.mutable
+    if ismutable(type_distmx)
         for e in edges(g)
             distmx[src(e), dst(e)] += wt_transform[dst(e)] - wt_transform[src(e)]
         end

src/Parallel/shortestpaths/johnson.jl

@@ -6,14 +6,14 @@ distmx::AbstractMatrix{T}=weights(g)) where T <: Real where U <: Integer
 #Change when parallel implementation of Bellman Ford available
     wt_transform = bellman_ford_shortest_paths(g, vertices(g), distmx).dists
 
-    if !type_distmx.mutable && type_distmx !=  Graphs.DefaultDistance
+    if !ismutable(type_distmx) && type_distmx !=  Graphs.DefaultDistance
         distmx = sparse(distmx) #Change reference, not value
     end
 
 #Weight transform not needed if all weights are positive.
     if type_distmx !=  Graphs.DefaultDistance
         for e in edges(g)
-            distmx[src(e), dst(e)] += wt_transform[src(e)] - wt_transform[dst(e)] 
+            distmx[src(e), dst(e)] += wt_transform[src(e)] - wt_transform[dst(e)]
         end
     end
 
@@ -28,12 +28,11 @@ distmx::AbstractMatrix{T}=weights(g)) where T <: Real where U <: Integer
         dists[:, v] .+= wt_transform[v] #Vertical traversal prefered
     end
 
-    if type_distmx.mutable
+    if ismutable(type_distmx)
         for e in edges(g)
             distmx[src(e), dst(e)] += wt_transform[dst(e)] - wt_transform[src(e)]
         end
     end
 
     return JohnsonState(dists, parents)
 end
-

src/shortestpaths/johnson.jl

@@ -29,15 +29,15 @@ function johnson_shortest_paths(g::AbstractGraph{U},
     type_distmx = typeof(distmx)
     #Change when parallel implementation of Bellman Ford available
     wt_transform = bellman_ford_shortest_paths(g, vertices(g), distmx).dists
-    
-    if !type_distmx.mutable && type_distmx !=  Graphs.DefaultDistance
+
+    if !ismutable(type_distmx) && type_distmx !=  Graphs.DefaultDistance
         distmx = sparse(distmx) #Change reference, not value
     end
 
     #Weight transform not needed if all weights are positive.
     if type_distmx !=  Graphs.DefaultDistance
         for e in edges(g)
-            distmx[src(e), dst(e)] += wt_transform[src(e)] - wt_transform[dst(e)] 
+            distmx[src(e), dst(e)] += wt_transform[src(e)] - wt_transform[dst(e)]
         end
     end
 
@@ -55,7 +55,7 @@ function johnson_shortest_paths(g::AbstractGraph{U},
         dists[:, v] .+= wt_transform[v] #Vertical traversal prefered
     end
 
-    if type_distmx.mutable
+    if ismutable(type_distmx)
         for e in edges(g)
             distmx[src(e), dst(e)] += wt_transform[dst(e)] - wt_transform[src(e)]
         end