The current algorithm for conversion is not very well optimized. It was made by me from scratch. As of today there are a ton of optimized graph exploration algorithm. I think we should implement something similar to the BFS algorithm. Once done this will be the 1.0 version (the library is already solid and tested for prdouction use).
The current algorithm for conversion is not very well optimized. It was made by me from scratch. As of today there are a ton of optimized graph exploration algorithm. I think we should implement something similar to the BFS algorithm. Once done this will be the 1.0 version (the library is already solid and tested for prdouction use).