Skip to content
This repository was archived by the owner on Aug 22, 2025. It is now read-only.

Commit 0d8904f

Browse files
committed
general fixes
1 parent 4a2d0ce commit 0d8904f

File tree

3 files changed

+13
-13
lines changed

3 files changed

+13
-13
lines changed

src/coloring/greedy_d1_coloring.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ function color_graph(g::VSafeGraph, alg::GreedyD1Color)
1111
v = nv(g)
1212
result = zeros(Int64, v)
1313
result[1] = 1
14-
available = BitArray{1}(undef, v)
14+
available = BitArray(undef, v)
1515
for i = 2:v
1616
for j in inneighbors(g, i)
1717
if result[j] != 0

src/coloring/greedy_star1_coloring.jl

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -25,24 +25,24 @@ function greedy_star1_coloring(g::LightGraphs.AbstractGraph)
2525
v = nv(g)
2626
color = zeros(Int64, v)
2727

28-
forbiddenColors = zeros(Int64, v+1)
28+
forbidden_colors = zeros(Int64, v+1)
2929

3030
for vertex_i = vertices(g)
3131

3232
for w in inneighbors(g, vertex_i)
3333
if color[w] != 0
34-
forbiddenColors[color[w]] = vertex_i
34+
forbidden_colors[color[w]] = vertex_i
3535
end
3636

3737
for x in inneighbors(g, w)
3838
if color[x] != 0
3939
if color[w] == 0
40-
forbiddenColors[color[x]] = vertex_i
40+
forbidden_colors[color[x]] = vertex_i
4141
else
4242
for y in inneighbors(g, x)
4343
if color[y] != 0
4444
if y != w && color[y] == color[w]
45-
forbiddenColors[color[x]] = vertex_i
45+
forbidden_colors[color[x]] = vertex_i
4646
break
4747
end
4848
end
@@ -52,15 +52,15 @@ function greedy_star1_coloring(g::LightGraphs.AbstractGraph)
5252
end
5353
end
5454

55-
color[vertex_i] = find_min_color(forbiddenColors, vertex_i)
55+
color[vertex_i] = find_min_color(forbidden_colors, vertex_i)
5656
end
5757

5858
color
5959
end
6060

61-
function find_min_color(forbiddenColors::AbstractVector, vertex_i::Integer)
61+
function find_min_color(forbidden_colors::AbstractVector, vertex_i::Integer)
6262
c = 1
63-
while (forbiddenColors[c] == vertex_i)
63+
while (forbidden_colors[c] == vertex_i)
6464
c+=1
6565
end
6666
c

src/coloring/greedy_star2_coloring.jl

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -28,29 +28,29 @@ function greedy_star2_coloring(g::LightGraphs.AbstractGraph)
2828
v = nv(g)
2929
color = zeros(Int64, v)
3030

31-
forbiddenColors = zeros(Int64, v+1)
31+
forbidden_colors = zeros(Int64, v+1)
3232

3333
for vertex_i = vertices(g)
3434

3535
for w in inneighbors(g, vertex_i)
3636
if color[w] != 0
37-
forbiddenColors[color[w]] = vertex_i
37+
forbidden_colors[color[w]] = vertex_i
3838
end
3939

4040
for x in inneighbors(g, w)
4141
if color[x] != 0
4242
if color[w] == 0
43-
forbiddenColors[color[x]] = vertex_i
43+
forbidden_colors[color[x]] = vertex_i
4444
else
4545
if color[x] < color[w]
46-
forbiddenColors[color[x]] = vertex_i
46+
forbidden_colors[color[x]] = vertex_i
4747
end
4848
end
4949
end
5050
end
5151
end
5252

53-
color[vertex_i] = find_min_color(forbiddenColors, vertex_i)
53+
color[vertex_i] = find_min_color(forbidden_colors, vertex_i)
5454
end
5555

5656
color

0 commit comments

Comments
 (0)