#341 develop to master for v0.6-RC1

See merge request !336

#341 Release note updates for v0.6-RC1.

See merge request !335

#196 Add DCSH variable ordering heuristic.

See merge request !334

- Required renaming some methods in VarOrdererHelper to avoid duplicate
overloads after type erasure.
- Some other methods in that class also renamed, for consistency.

#196 Add node ordering algorithms, including dependencies, for later use by DCSH

See merge request !333

- Added DCSH algorithm/option.
- Extended explanation of heuristic algorithms in general.
- Extended explanation of when algorithms are not applied.
- Extended descriptions of the FORCE and sliding window algorithms.

- Is for now based on graphs constructed from the original hyper-edges.
  - Could later create DMSs/hyper-edges based on the paper's approach.
- Is for now based on total span.
  - Could later also adopt the WES metric.
  - Until we adopt the WES metric, the reverse orders are never chosen.
  - Reversing the order has no effect on the total span.

#374 Use default maximum available memory for product as determined by JVM

Closes #374

See merge request !328

- I tried to stay as close as possible to the original papers.
- These are the ones we need for the DCSH variable ordering algorithm.
- Weighted Cuthill-McKee has been improved wrt the original paper:
  - It works also for multiple unconnected partitions with >1 node.

- I tried to stay as close as possible to the original papers.
- We have multiple:
  - We could experiment later which ones work best.
  - For now, node ordering algorithms use the ones from their papers.
  - (Node ordering algorithms are added in a follow-up commit.)

#196 Add graphs as representation to VarOrdererHelper.

See merge request !332

- Avoid computing edge count twice.
- Compute graph partitions internally as bitsets for efficiency.
- Indicate string representations are for debugging/testing only.
- Only allow positive weights, for simpler and more correct code.

Merge branch '311-consider-warning-for-disallowing-plant-referencing-requirements-in-cif' into 'develop'

#311 Add warning for plant referencing requirements in CIF

Closes #311

See merge request !315

- For now, graphs are created from the existing hyper-edges.
- This ensures consistency between the representations.
- We could later opt for other ways to create the hyper-edges/graphs.
- Added extra utility methods for use by variable ordering algorithms.

#370 Generalized CIF to Supremica precondition checks to reusable checks.

See merge request eclipse/escet/escet!326

 - Avoids the need for EnumSet in most cases.

Merge branch '369-fix-outdated-comments-in-synthesistocifconverter-regarding-explicit-kinds' into 'develop'

#369 Fix outdated comments in SynthesisToCifConverter regarding explicit kinds

Closes #369

See merge request !330

#381 Third party dependencies license check update (2022-06-12)

Closes #381

See merge request !329