You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello, thanks a lot for the great library, much appreciated.
I am using the library to find the optimal path between nodes in an orthogonal network layout (i.e. on a grid).
I was wondering if there might be a simple way to extend the library in order to minimize path bends??
The literature on graph layout algorithms/pathfinding is immense, perhaps someone already has a good idea for an implementation.
If someone has an idea how this might be possible I'm happy to work with them to submit a PR.
Thanks
The text was updated successfully, but these errors were encountered:
Hello, thanks a lot for the great library, much appreciated.
I am using the library to find the optimal path between nodes in an orthogonal network layout (i.e. on a grid).
I was wondering if there might be a simple way to extend the library in order to minimize path bends??
The literature on graph layout algorithms/pathfinding is immense, perhaps someone already has a good idea for an implementation.
If someone has an idea how this might be possible I'm happy to work with them to submit a PR.
Thanks
The text was updated successfully, but these errors were encountered: