You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/constant.jl
+40-40Lines changed: 40 additions & 40 deletions
Original file line number
Diff line number
Diff line change
@@ -4,20 +4,24 @@
4
4
Coloring algorithm which always returns the same precomputed vector of colors.
5
5
Useful when the optimal coloring of a matrix can be determined a priori due to its specific structure (e.g. banded).
6
6
7
-
It is passed as an argument to the main function [`coloring`](@ref), but will only work if the associated `problem` has `:nonsymmetric` structure.
8
-
Indeed, for symmetric coloring problems, we need more than just the vector of colors to allow fast decompression.
7
+
It is passed as an argument to the main function [`coloring`](@ref), but will only work if the associated `problem` has a `:column` or `:row` partition.
- `partition::Symbol`: either `:row` or `:column`.
19
+
- `structure::Symbol`: either `:nonsymmetric` or `:symmetric`.
16
20
- `matrix_template::AbstractMatrix`: matrix for which the vector of colors was precomputed (the algorithm will only accept matrices of the exact same size).
17
21
- `color::Vector{<:Integer}`: vector of integer colors, one for each row or column (depending on `partition`).
18
22
19
23
!!! warning
20
-
The second constructor (based on keyword arguments) is type-unstable.
24
+
The constructor based on keyword arguments is type-unstable if these arguments are not compile-time constants.
21
25
22
26
We do not necessarily verify consistency between the matrix template and the vector of colors, this is the responsibility of the user.
0 commit comments