get rid of those **** Int64s

Author: ChrisRackauckas

src/coloring/bsc_algo.jl

@@ -5,10 +5,10 @@
 """
 function color_graph(G::VSafeGraph,::BSCColor)
     V = nv(G)
-    F = zeros(Int64, V)
-    freeColors = [Vector{Int64}() for _ in 1:V] #set of free colors for each vertex
-    U = zeros(Int64, 0) #stores set of free colors
-    #F = zeros(Int64, 0) #stores final coloring of vertices
+    F = zeros(Int, V)
+    freeColors = [Vector{Int}() for _ in 1:V] #set of free colors for each vertex
+    U = zeros(Int, 0) #stores set of free colors
+    #F = zeros(Int, 0) #stores final coloring of vertices
 
     sorted_vertices = order_by_degree(G)
     start = 1
@@ -71,15 +71,15 @@ end
 
 Find the degree of the vertex z which belongs to the graph G.
 """
-function degree(G::VSafeGraph,z::Int64)
+function degree(G::VSafeGraph,z::Int)
     return length(inneighbors(G,z))
 end
 
 
 function sorted_vertices(G::VSafeGraph)
     V = nv(G)
-    marked = zeros(Int64,V)
-    sv = zeros(Int64,0)
+    marked = zeros(Int,V)
+    sv = zeros(Int,0)
     max_degree = -1
     max_degree_vertex = -1
     for i = 1:V
@@ -100,8 +100,8 @@ function sorted_vertices(G::VSafeGraph)
 end
 
 #find uncolored vertex of maximal degree of saturation
-function find_uncolored_vertex(sv::Array{Int64,1}, G::VSafeGraph)
-    colors = zeros(Int64,0)
+function find_uncolored_vertex(sv::Array{Int,1}, G::VSafeGraph)
+    colors = zeros(Int,0)
     max_colors = -1
     max_color_index = -1
     for i = 1:nv(G)
@@ -116,7 +116,7 @@ function find_uncolored_vertex(sv::Array{Int64,1}, G::VSafeGraph)
                 max_color_index = i
             end
         end
-        colors = zeros(Int64,0)
+        colors = zeros(Int,0)
     end
     for i = 1:nv(G)
         if A[i] == max_color_index
@@ -127,8 +127,8 @@ function find_uncolored_vertex(sv::Array{Int64,1}, G::VSafeGraph)
 end
 
 #set of free colors of x, which are < optColorNumber
-function free_colors(x::Int64, F::Array{Int64,1}, G::VSafeGraph, max_color::Int64)
-    colors = zeros(Int64,0)
+function free_colors(x::Int, F::Array{Int,1}, G::VSafeGraph, max_color::Int)
+    colors = zeros(Int,0)
     for color in 1:max_color
         present = true
         for y in inneighbors(G,x)
@@ -145,7 +145,7 @@ function free_colors(x::Int64, F::Array{Int64,1}, G::VSafeGraph, max_color::Int6
 end
 
 #least index with F(A[i]) = optColorNumber
-function least_index(A::Array{Int64, 1}, F::Array{Int64,1}, optColorNumber::Int64, G::VSafeGraph)
+function least_index(A::Array{Int, 1}, F::Array{Int,1}, optColorNumber::Int, G::VSafeGraph)
     for i = 1:nv(G)
         if F[A[i]] == optColorNumber
             return i
@@ -154,15 +154,15 @@ function least_index(A::Array{Int64, 1}, F::Array{Int64,1}, optColorNumber::Int6
 end
 
 #uncolor all vertices A[i] with i >= start
-function uncolor_all(F::Array{Int64,1}, A::Array{Int64,1}, start::Int64, G::VSafeGraph)
+function uncolor_all(F::Array{Int,1}, A::Array{Int,1}, start::Int, G::VSafeGraph)
     for i = start:nv(G)
         F[A[i]] = 0
     end
 end
 
 #remove from U all colors >= optColorNumber
-function remove_colors(U::Array{Int64,1}, optColorNumber::Int64)
-    modified_U = zeros(Int64,0)
+function remove_colors(U::Array{Int,1}, optColorNumber::Int)
+    modified_U = zeros(Int,0)
     for i = 1:length(U)
         if U[i] < optColorNumber
             push!(mmodified_U, U[i])

src/coloring/contraction_coloring.jl

@@ -8,7 +8,7 @@ function color_graph(G::VSafeGraph,::ContractionColor)
 
     colornumber = 0
     V = nv(G)
-    colors = zeros(Int64,V)
+    colors = zeros(Int,V)
 
     while (V > 0)
         x = max_degree_vertex(G)
@@ -47,7 +47,7 @@ end
 Find the vertex in the group nn of vertices belonging to the
 graph G which has the highest degree.
 """
-function max_degree_vertex(G::VSafeGraph,nn::Array{Int64,1})
+function max_degree_vertex(G::VSafeGraph,nn::Array{Int,1})
 
     max_degree = -1
     max_degree_vertex = -1
@@ -90,9 +90,9 @@ end
 Find the set of vertices belonging to the graph G which do
 not share an edge with the vertex x.
 """
-function non_neighbors(G::VSafeGraph, x::Int64)
+function non_neighbors(G::VSafeGraph, x::Int)
 
-    nn = zeros(Int64, 0)
+    nn = zeros(Int, 0)
     for v in vertices(G)
         if v == x
             continue
@@ -112,7 +112,7 @@ end
 Find the number of vertices that share an edge with both the
 vertices z and x belonging to the graph G.
 """
-function length_common_neighbor(G::VSafeGraph,z::Int64, x::Int64)
+function length_common_neighbor(G::VSafeGraph,z::Int, x::Int)
 
     z_neighbors = inneighbors(G,z)
     x_neighbors = inneighbors(G,x)
@@ -133,7 +133,7 @@ end
 
 Find the degree of the vertex z which belongs to the graph G.
 """
-function vertex_degree(G::VSafeGraph,z::Int64)
+function vertex_degree(G::VSafeGraph,z::Int)
 
     return length(inneighbors(G,z))
 
@@ -147,7 +147,7 @@ Contract the vertex y to x, both of which belong to graph G, that is
 delete vertex y and join x with the neighbors of y if they are not
 already connected with an edge.
 """
-function contract!(G::VSafeGraph,y::Int64, x::Int64)
+function contract!(G::VSafeGraph,y::Int, x::Int)
 
     for v in inneighbors(G,y)
         if has_edge(G,v,x) == false

src/coloring/greedy_d1_coloring.jl

@@ -9,7 +9,7 @@ number χ(G) of the graph.
 """
 function color_graph(g::VSafeGraph, alg::GreedyD1Color)
     v = nv(g)
-    result = zeros(Int64, v)
+    result = zeros(Int, v)
     result[1] = 1
     available = BitArray(undef, v)
     for i = 2:v

src/coloring/greedy_star1_coloring.jl

@@ -23,9 +23,9 @@
 """
 function color_graph(g::LightGraphs.AbstractGraph, ::GreedyStar1Color)
     v = nv(g)
-    color = zeros(Int64, v)
+    color = zeros(Int, v)
 
-    forbidden_colors = zeros(Int64, v+1)
+    forbidden_colors = zeros(Int, v+1)
 
     for vertex_i = vertices(g)
 

src/coloring/greedy_star2_coloring.jl

@@ -26,9 +26,9 @@
 """
 function color_graph(g::LightGraphs.AbstractGraph, :: GreedyStar2Color)
     v = nv(g)
-    color = zeros(Int64, v)
+    color = zeros(Int, v)
 
-    forbidden_colors = zeros(Int64, v+1)
+    forbidden_colors = zeros(Int, v+1)
 
     for vertex_i = vertices(g)
 

src/differentiation/compute_jacobian_ad.jl

@@ -46,7 +46,7 @@ end
 generate_chunked_partials(x,color,N::Integer) = generate_chunked_partials(x,color,Val(N))
 function generate_chunked_partials(x,color,::Val{chunksize}) where chunksize
 
-    num_of_chunks = Int64(ceil(maximum(color) / chunksize))
+    num_of_chunks = Int(ceil(maximum(color) / chunksize))
 
     padding_size = (chunksize - (maximum(color) % chunksize)) % chunksize