Bug fixes
Two major changes in this release:
- 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.
- The default edge finding algorithm is the memoized algorithm now, which should perform better in terms of speed.