it is a pain to rebase...

Author: amontoison

src/decompression.jl

@@ -779,6 +779,8 @@ function decompress!(
         symmetric_to_row,
         symmetric_to_column,
         reverse_bfs_orders,
+        tree_edge_indices,
+        nt,
         buffer,
     ) = result
     (; S) = ag
@@ -834,6 +836,8 @@ function decompress!(
         symmetric_to_column,
         symmetric_to_row,
         reverse_bfs_orders,
+        tree_edge_indices,
+        nt,
         A_indices,
         buffer,
     ) = result

src/result.jl

@@ -716,6 +716,8 @@ struct TreeSetBicoloringResult{
     A_indices::Vector{T}
     "reverse BFS orders of the trees"
     reverse_bfs_orders::Vector{Tuple{T,T}}
+    tree_edge_indices::Vector{T}
+    nt::T
     "buffer needed during acyclic decompression"
     buffer::Vector{R}
 end
@@ -728,7 +730,7 @@ function TreeSetBicoloringResult(
     tree_set::TreeSet{<:Integer},
     decompression_eltype::Type{R},
 ) where {T,R}
-    (; reverse_bfs_orders) = tree_set
+    (; reverse_bfs_orders, tree_edge_indices, nt) = tree_set
 
     m, n = size(A)
     num_sym_colors = maximum(symmetric_color)
@@ -788,6 +790,8 @@ function TreeSetBicoloringResult(
         symmetric_to_row,
         A_indices,
         reverse_bfs_orders,
+        tree_edge_indices,
+        nt,
         buffer,
     )
 end