Releases: gdalle/SparseMatrixColorings.jl
Releases · gdalle/SparseMatrixColorings.jl
v0.4.3
v0.4.2
SparseMatrixColorings v0.4.2
Merged pull requests:
- Manual graph transposition (#107) (@amontoison)
- Get rid of inefficient
findnz(#111) (@gdalle) - Replace
sparse(A)withconvert(SparseMatrixCSC, A)(#112) (@gdalle) - Remove dynamic allocations in group_by_color (#113) (@amontoison)
- Improve graph structure a little bit (#114) (@gdalle)
- Consider distance-2 degree for
LargestFirstorder in bipartite graph (#119) (@gdalle) - Rename variables
n -> nvande -> ne(#120) (@gdalle) - Clearly separate graphs from the sparsity pattern (#123) (@gdalle)
- Implement
ConstantColoringAlgorithm(#127) (@gdalle) - Bump to v0.4.2 (#128) (@gdalle)
Closed issues:
- Implement coloring when the color vector is known (#124)
v0.4.1
SparseMatrixColorings v0.4.1
Merged pull requests:
- Update authors in Project.toml (#91) (@amontoison)
- Update result.jl (#92) (@amontoison)
- Use a more efficient
queueinTreeSetResult(#94) (@amontoison) - Add tests with
SymmetricandHermitianinputs (#100) (@gdalle) - Save allocations for bipartite graph with symmetric patterns (#102) (@gdalle)
- Avoid allocation when creating adjacency graph (#104) (@gdalle)
- Add benchmarks (#105) (@gdalle)
- Add CI benchmarks for real (workflow) (#106) (@gdalle)
- Update result.jl (#109) (@amontoison)
- Bump to v0.4.1 (#110) (@gdalle)
Closed issues:
v0.4.0
SparseMatrixColorings v0.4.0
Merged pull requests:
- Downgrade compat in CI (#33) (@gdalle)
- Speed up symmetric decompression (#34) (@gdalle)
- Add an acyclic coloring (#36) (@amontoison)
- Introduce coloring results (#38) (@gdalle)
- Test on non-boolean matrices (#39) (@gdalle)
- Remove preparation to speed up ADTypes interface (#41) (@gdalle)
- Add more examples to docstrings (#42) (@gdalle)
- Introduce ColoringProblem (#45) (@gdalle)
- Clean up small examples from papers (#46) (@gdalle)
- Better documentation (#47) (@gdalle)
- Don't export ADTypes interface (#48) (@gdalle)
- Fix docs typos (#49) (@gdalle)
- Fix wrong example from paper (#50) (@gdalle)
- Optimize acyclic_coloring (#52) (@amontoison)
- Improve the decompression for acyclic coloring (#54) (@amontoison)
- Implement
TreeSet-based acyclic decompression (#55) (@amontoison) - Export decompress and split API docs (#56) (@gdalle)
- Implement StarSetColoringResult and TreeSetColoringResult (#57) (@gdalle)
- Implement
compress(#58) (@gdalle) - Remove commented acyclic decompression to make future PR cleaner (#59) (@gdalle)
- Reach 100% coverage (#60) (@gdalle)
- Improve the docstring of acyclic_coloring (#61) (@amontoison)
- Factor out testing code (#62) (@gdalle)
- Generalize the API to enable bicoloring (#63) (@gdalle)
- Make decompression more efficient (#71) (@gdalle)
- More optimization for the decompression of the acyclic coloring (#73) (@amontoison)
- More correctness tests for symmetric coloring (#74) (@gdalle)
- Allocation-free decompression in all cases (#76) (@gdalle)
- Remove ColPack.jl comparison tests (#78) (@gdalle)
- Make type-stable constructors part of the API (#80) (@gdalle)
- Implement single-color decompression (#81) (@gdalle)
- Add doctest to
decompress_single_color!(#82) (@gdalle) - Add option to decompress into a triangle only (#83) (@gdalle)
- Add systematic allocation and type stability tests (#84) (@gdalle)
- Replace
:ULwith:Fto select a triangle (#85) (@gdalle) - Warn that single-color decompression is for direct coloring only (#87) (@gdalle)
- Bringe coverage to 100% (#88) (@gdalle)
- Only check sparsity pattern equality when
uplo == :F(#89) (@gdalle) - Fix star decompression into
SparseMatrixCSCtriangle (#90) (@gdalle)
Closed issues:
- Sparsity pattern comparison (#16)
- Add decompression of individual colors? (#30)
- Should decompression be represented as a matrix multiplication? (#35)
- Coloring results (#37)
- Reinsert star set decompression (#40)
- Support plain color vectors for decompression and analysis (#43)
- Provide
eltypeof decompression targetA(#44) - Add more methods for coloring? (#51)
- Export decompress and decompress! (#53)
- Should the decompression method go in the
ColoringProblemor in theColoringAlgorithm? (#66) - Optimize decompression by substitution for sparse and dense (#68)
- Make
S::SparseMatrixCSC{Bool,Int}(#69) - Why does dense decompression allocate? (#72)
- Provide type-stable constructors (#77)
- Add an option to just decompress in one triangle for star and acyclic coloring (#79)
- Single-color decompression for
TreeSetColoringResult? (#86)
v0.3.6
v0.3.5
SparseMatrixColorings v0.3.5
Merged pull requests: