rm unused nv(G) (#73)

JuliaGraphs · Nov 26, 2021 · 430dcfc · 430dcfc
1 parent f7ac776
commit 430dcfc
Showing 1 changed file with 0 additions and 2 deletions.
diff --git a/src/connectivity.jl b/src/connectivity.jl
@@ -11,8 +11,6 @@ to each vertex. The component value is the smallest vertex ID in the component.
 This algorithm is linear in the number of edges of the graph.
 """
 function connected_components!(label::AbstractVector, g::AbstractGraph{T}) where T
-    nvg = nv(g)
-
     for u in vertices(g)
         label[u] != zero(T) && continue
         label[u] = u