Skip to content

Bug fixes

Compare
Choose a tag to compare
@bsuwal bsuwal released this 24 Feb 21:48
· 164 commits to main since this release
01b8801

Two major changes in this release:

  1. When we generate a random spanning tree we were assigning a "weights" key to the edges of the graph. Apparently Networkx uses this field for its other functions (like when generating the laplacian). This was fixed by changing the keyword to "random_weight" instead.
  2. The default edge finding algorithm is the memoized algorithm now, which should perform better in terms of speed.