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.