modified distance-1 coloring

Author: pkj-m

src/coloring/greedy_d1_coloring.jl

@@ -1,30 +1,30 @@
 """
-        GreedyD1 Coloring
+        greedy_d1_coloring
 
 Find a coloring of a given input graph such that
 no two vertices connected by an edge have the same
 color using greedy approach. The number of colors
 used may be equal or greater than the chromatic
 number χ(G) of the graph.
 """
-function color_graph(G::VSafeGraph, alg::GreedyD1Color)
-    V = nv(G)
-    result = zeros(Int64, V)
+function color_graph(g::VSafeGraph, alg::GreedyD1Color)
+    v = nv(g)
+    result = zeros(Int64, v)
     result[1] = 1
-    available = zeros(Int64, V)
-    for i = 2:V
-        for j in inneighbors(G, i)
+    available = BitArray{1}(undef, v)
+    for i = 2:v
+        for j in inneighbors(g, i)
             if result[j] != 0
-                available[result[j]] = 1
+                available[result[j]] = true
             end
         end
-        for cr = 1:V
-            if available[cr] == 0
+        for cr = 1:v
+            if available[cr] == false
                 result[i] = cr
                 break
             end
         end
-        available = zeros(Int64, V)
+        fill!(available, false)
     end
     return result
 end