Skip to content

v0.4.0
Compare
Choose a tag to compare
@amkrajewski amkrajewski released this 12 Jan 14:18
· 258 commits to main since this release
v0.4.0
f6d71b2

Major Changes:

  • Finished implementing procedures for the generation of simplex graphs, where all points of uniform grids are connected to their neighbors using just combinatorics in O(N) time, as described in the upcoming manuscript.
  • Added graph generation to the task routing based on configured or interactive CLI.
  • Added Python interface for graph generating algorithms.
  • Added NumPy output for graph generating algorithms, where a grid of nodes is exported as usual NDArray and the neighborhood sequence of sequences is exported as a sparse NDArray with size N x d(d-1) and -1 denoting no neighbor spots.
  • Added independent test scripts with several suits of several tests, for:
    1. Simplex grid generation (full/internal, integer/fractional, print output / shape)
    2. Simplex graph generation (integer/fractional, print output / shape)
    3. Command Line Interface (CLI) interactions covering grids, graphs, and NumPy outputs runtime and correctness.

Minor Changes:

  • Added 3-component-specific graph generation algorithm, which (1) accesses the neighbor list sequentially, allowing further optimizations, and (2) doesn't calculate binom, allowing for approximately 30% speed up relative to arbitrary-dimensional algorithm.
  • Numerous small optimizations and style improvements.

Full Changelog: v0.3.0...v0.4.0

Assets 2
Loading