Fix more errors

Author: amontoison

src/order.jl

@@ -335,13 +335,13 @@ end
 function vertices(
     g::AdjacencyGraph{T}, order::DynamicDegreeBasedOrder{degtype,direction}
 ) where {T<:Integer,degtype,direction}
+    true_degrees = degrees = T[degree(g, v) for v in vertices(g)]
+    max_degrees = maximum(true_degrees)
     if degree_increasing(; degtype, direction)
-        degrees = zeros(T, nb_vertices(g))
-    else
-        degrees = T[degree(g, v) for v in vertices(g)]
+        fill!(degrees, zero(T))
     end
     db = DegreeBuckets(
-        T, degrees, maximum(true_degrees); reproduce_colpack=order.reproduce_colpack
+        T, degrees, max_degrees; reproduce_colpack=order.reproduce_colpack
     )
     π = T[]
     sizehint!(π, nb_vertices(g))
@@ -361,33 +361,33 @@ function vertices(
     g::BipartiteGraph{T}, ::Val{side}, order::DynamicDegreeBasedOrder{degtype,direction}
 ) where {T<:Integer,side,degtype,direction}
     other_side = 3 - side
+    # compute dist-2 degrees in an optimized way
     n = nb_vertices(g, Val(side))
-    degrees_dist2 = zeros(T, n)
+    degrees_dist2 = degrees = zeros(T, n)
     visited = fill(false, n)
     vertices_visited = zeros(T, n-1)
     num_visited = zero(T)
-    # compute dist-2 degrees in an optimized way (if needed)
-    if degree_increasing(; degtype, direction)
-        for v in vertices(g, Val(side))
-            for w1 in neighbors(g, Val(side), v)
-                for w2 in neighbors(g, Val(other_side), w1)
-                    if w2 != v && !visited[w2]
-                        degrees_dist2[v] += 1
-                        visited[w2] = true
-                        num_visited += 1
-                        vertices_visited[num_visited] = w2
-                    end
+    for v in vertices(g, Val(side))
+        for w1 in neighbors(g, Val(side), v)
+            for w2 in neighbors(g, Val(other_side), w1)
+                if w2 != v && !visited[w2]
+                    degrees_dist2[v] += 1
+                    visited[w2] = true
+                    num_visited += 1
+                    vertices_visited[num_visited] = w2
                 end
             end
-            for k in 1:num_visited
-                z = vertices_visited[k]
-                visited[z] = false
-            end
-            num_visited = 0
         end
+        for k in 1:num_visited
+            z = vertices_visited[k]
+            visited[z] = false
+        end
+        num_visited = 0
     end
-    degrees = degrees_dist2
     maxd2 = maximum(degrees_dist2)
+    if degree_increasing(; degtype, direction)
+        fill!(degrees, zero(T))
+    end
     db = DegreeBuckets(T, degrees, maxd2; reproduce_colpack=order.reproduce_colpack)
     π = T[]
     sizehint!(π, n)