Skip to content

v1.2 CPQ Cores
Compare
Choose a tag to compare
@RoanH RoanH released this 04 Jul 20:14
· 145 commits to master since this release
v1.2
This tag was signed with the committer’s verified signature.
RoanH Roan Hofland
GPG key ID: 899C7639CD04E21C
Learn about vigilant mode.
0aaa010
This commit was signed with the committer’s verified signature.
RoanH Roan Hofland
GPG key ID: 899C7639CD04E21C
Learn about vigilant mode.

This release again focuses on introducing a number of CPQ related utilities, most notably CPQ core computation. These features were added for use in my Master's Thesis project.

Notable changes:

  • CPQ Core computation.
  • CPQ Homomorphism testing.
  • The Graph class was renamed to UniqueGraph.
  • Added SimpleGraph which is more performant than UniqueGraph but also limited to unlabelled undirected graphs without parallel edges.
  • Tree implementation for tree graphs.
  • Various utility extensions to the existing CPQ and QueryGraphCPQ APIs.
    • Getting the diameter of a CPQ.
    • Checking if a CPQ is a loop.
    • More CPQ construction subroutines.
    • Option to reverse a query graph.
    • Support for parsing text form CPQs.
  • GraphPanel now supports undirected graphs.
  • GraphPanel factory methods to quickly show CPQs/query graphs/unique graphs.
  • Tree decomposition algorithm implementation for graphs of treewidth at most 2.
  • Support to copy unique graphs, rename nodes in them and restore deleted edges.
  • Maximal matching algorithm implementation
  • Cartesian product algorithm implementation
  • All subsets algorithm implementation.
  • Update to Java 17 and minor code improvements.
Assets 4
Loading