We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
(following this discussion : http://forum-gephi.org/viewtopic.php?f=7&t=2917&p=14756#p14756)
It should exist a filter to display only the nodes involved in a "shortest path" from one node to another
Currently the Gephi can find automatically the shortest path but it can only change the color of the nodes involved.
As Gephi can already automatically find the shortest path, I assume that most of the work required is already done.
Big potential for the interest of Gephi software
The text was updated successfully, but these errors were encountered:
It will be great to see this feature added.
Sorry, something went wrong.
Yes I would love this feature too. I would also like the ability to calculate the short path between more than two nodes
+1
Implement shortest path filter #1859
8d1dc4a
Thanks for the idea, this feature will be included in the 0.10.0 release.
mbastian
No branches or pull requests
(following this discussion : http://forum-gephi.org/viewtopic.php?f=7&t=2917&p=14756#p14756)
Expected Behavior
It should exist a filter to display only the nodes involved in a "shortest path" from one node to another
Current Behavior
Currently the Gephi can find automatically the shortest path but it can only change the color of the nodes involved.
Possible Solution
As Gephi can already automatically find the shortest path, I assume that most of the work required is already done.
Steps to Reproduce
Context
Big potential for the interest of Gephi software
Your Environment
The text was updated successfully, but these errors were encountered: