v0.4.7

SparseMatrixColorings v0.4.7

Diff since v0.4.6

Merged pull requests:

• Speed up group_by_color (#116) (@gdalle)
• Decompression of acyclic coloring with SparseMatrixCSC (#130) (@amontoison)
• Add tests for structured matrices (#137) (@gdalle)
• Implement efficient adjacency graph from bipartite (#145) (@gdalle)
• Working prototype for bicoloring (coloring + decompression) (#146) (@gdalle)
• Drop support for Julia 1.6 (#148) (@gdalle)
• Add package extension for visualization of colorings (#149) (@adrhill)
• Bump version to v0.4.7 (#150) (@gdalle)

Closed issues:

• Decompression of acyclic coloring with SparseMatrixCSC (#93)
• Custom adjacency graph from bipartite graph (#144)

v0.4.6

SparseMatrixColorings v0.4.6

Diff since v0.4.5

Merged pull requests:

• Support ADTypes.NoColoringAlgorithm (#142) (@gdalle)

Closed issues:

• Support NoColoringAlgorithm from ADTypes (#141)

v0.4.5

SparseMatrixColorings v0.4.5

Diff since v0.4.4

Merged pull requests:

• Improve type stability in star set (#140) (@gdalle)

v0.4.4

SparseMatrixColorings v0.4.4

Diff since v0.4.3

Merged pull requests:

• Add sparsity_pattern getter for results (#135) (@gdalle)

v0.4.3

SparseMatrixColorings v0.4.3

Diff since v0.4.2

Merged pull requests:

• Merge two decompress! for star coloring (#129) (@amontoison)
• Store graph in result to allow generic matrices (#133) (@gdalle)
• Bump version to 0.4.3 (#134) (@gdalle)

Closed issues:

• Store graph object in coloring result (#126)
• Avoid forcing eltype equality between A and B in decompress! (#131)

v0.4.2

SparseMatrixColorings v0.4.2

Diff since v0.4.1

Merged pull requests:

• Manual graph transposition (#107) (@amontoison)
• Get rid of inefficient findnz (#111) (@gdalle)
• Replace sparse(A) with convert(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 LargestFirst order in bipartite graph (#119) (@gdalle)
• Rename variables n -> nv and e -> 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

Diff since v0.4.0

Merged pull requests:

• Update authors in Project.toml (#91) (@amontoison)
• Update result.jl (#92) (@amontoison)
• Use a more efficient queue in TreeSetResult (#94) (@amontoison)
• Add tests with Symmetric and Hermitian inputs (#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:

• Add an option to specify that a Jacobian has a symmetrical structure (#97)
• Avoid unnecessary matrix allocations (#99)
• Error with acyclic coloring (#108)

v0.4.0

SparseMatrixColorings v0.4.0

Diff since v0.3.6

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 :UL with :F to 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 SparseMatrixCSC triangle (#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 eltype of decompression target A (#44)
• Add more methods for coloring? (#51)
• Export decompress and decompress! (#53)
• Should the decompression method go in the ColoringProblem or in the ColoringAlgorithm? (#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

SparseMatrixColorings v0.3.6

Diff since v0.3.5

Merged pull requests:

• Lower DocStringExtensions compat (#31) (@gdalle)
• Update Compat.jl bounds for stack (#32) (@adrhill)

Closed issues:

• More efficient symmetric decompression (#14)

v0.3.5

SparseMatrixColorings v0.3.5

Diff since v0.3.4

Merged pull requests:

• Factor out symmetric_coefficient (#29) (@gdalle)