Thomas Jalabert

thanks a lot !

Hi, It's been a while since the last update. Is this layout will be added in GraphPlot? If not, is there an alternative package to add for Kamada Kawai layout?

Alright, thank you for the fast update.

I actually developed something similar in the meantime, using Optim.jl. I have a significantly smaller implementation than you, though. I am sure there a lot missing but maybe there are...

Hello, This algorithm performs really great but insert_point is really slow. Is there any update on this bottleneck and is it possible to create a batch insert which could potentially...

I've seen this example. Does it matter if all the points are not in each of the trees of your forest? Because I'm currently inserting around 50 000 points by...

Parallelization in python is incredibly easy. I already did it myself so I can write it down. ``` from pathos.multiprocessing import ProcessingPool from multiprocessing import cpu_count() def _insert_multiproc(self, features, n_jobs:int...

I tested the parallelization. It's the perfect use case of parallelization because the trees are independents. Each processor can compute its tree separately. With N processors and K trees in...

Thank you for your prompt reply. I'll be glad to try this new feature. Meanwhile I will try to find a workaround.

This is because you are using TensorFlow 2.X and wavegan require tensorflow-gpu==1.12.0