We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 39b3fa8 commit 8db47d4Copy full SHA for 8db47d4
1 file changed
src/coloring.jl
@@ -424,7 +424,7 @@ function TreeSet(
424
# Note: the number of vertices in a tree is equal the number of edges plus one
425
nvmax = maximum(tree_edge_indices) + one(T)
426
427
- # Vector containing the list of vertices, grouped by tree
+ # Vector containing the list of vertices, grouped by tree (each vertex appears once for every tree it belongs to)
428
# Note: the total number of edges in the graph is "ne", so there are "ne + nt" vertices across all trees
429
tree_vertices = Vector{T}(undef, ne + nt)
430
0 commit comments