Find shortest path between nodes

Feature Requests
1

Hi

Currently we use Neo4J to find the shortest path between 2 nodes. Can you please take a look to implement something like this in Polinode. If we can select 2 nodes and use a shortcut to find the shortest path based on the edges not filtered out it will be great. It will also be great to be able to select between least hops and lowest cost path based on edge size value.

Please contact me if you require any further information.

Thanks

2

Thanks for the feature request! I can’t promise anything in the short term but you are certainly not the only person to have asked for this feature.

PS: Please feel free to upvote your own feature request.