Skip to content
New issue

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

Shortest Path #18

Open
rezaakhmadg opened this issue Jan 29, 2014 · 2 comments
Open

Shortest Path #18

rezaakhmadg opened this issue Jan 29, 2014 · 2 comments

Comments

@rezaakhmadg
Copy link

Hello sir , i've been trying to know much more about sigma-js that you share for gexf file format for gephi.

is there any source code for the shortest path? so i can make some path from a node to another node.. thank you so much :)

@raphv
Copy link
Owner

raphv commented Jan 30, 2014

Hello, Reza.

For sigma-js, you should try to go to the sigma-js repository, which is at https://github.com/jacomyal/sigma.js

The problem you describe is a well-known problem in graph theory and there are several algorithms that deal with it. It even has its own Wikipedia page that I'd recommend you to read, or you may just skip to the algorithms section, which links to pages describing these algorithms:

http://en.wikipedia.org/wiki/Shortest_path_problem#Algorithms

@rezaakhmadg
Copy link
Author

Hello, Sir Raphael
thank you for the reply ,
yes sir i have read the algorithms that you give to me, but sadly i cant implement the algorithms into the code that you build for the GEXF javascript library which the library links here : https://github.com/raphv/gexf-js

because my final project for my study is implement the shortest path with a graph, so im using your javascript script that you share on github for my research but i dont know which file that i modify to give shortest path algorithms.

so many big thanks if you can help me sir,
thank you very much :)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants