v0.4.0

CliqueTrees v0.4.0

Diff since v0.3.0

Non-Breaking Changes:

• Added a new elimination algorithm MF, computing the minimum-fill heuristic.
• Added parameters to elimination algorithm METIS.
• Added parameter to elimination algorithm MMD.
• The algorithm RCM and function rcm now refer to the George-Liu variant of the reverse Cuthill-Mckee algorithm.

Breaking Changes:

• Chordal completions are now constructed using the FilledGraph constructor, rather than the eliminationgraph function.
• Renamed elimination algorithm: AAMD -> AMD.
• Renamed elimination algorithm: NodeND -> METIS.

v0.3.0

CliqueTrees v0.3.0

Diff since v0.2.1

Added three elimination algorithms.

• RCMGL (George-Liu variant of reverse Cuthill-McKee)
• LexM (a minimal variant of lexicographic breadth-first search)
• MCSM (a minimal variant of maximum cardinality search)

Supporting older versions of Julia.

• v1.9 (full)
• v1.8 (partial)

Breaking Changes

N/A

v0.2.1

CliqueTrees v0.2.1

Diff since v0.2.0

v0.2.0

CliqueTrees v0.2.0