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

Find all possible paths between two vertices on a graph #20

Open
titomiguelcosta opened this issue Feb 10, 2016 · 4 comments
Open

Find all possible paths between two vertices on a graph #20

titomiguelcosta opened this issue Feb 10, 2016 · 4 comments

Comments

@titomiguelcosta
Copy link

Is there a way to determine all possible paths between two vertices?

@clue
Copy link
Member

clue commented Feb 11, 2016

determine all possible paths between two vertices?

PRs are welcome, I suppose :-)

Perhaps the following could be a good start for an implementation:

@titomiguelcosta
Copy link
Author

@clue in the end, I followed this tutorial and ended up implementing a neat solution using a recursive sql query, something i wasn't even aware it existed

@clue
Copy link
Member

clue commented Feb 16, 2016

I followed this tutorial and ended up implementing a neat solution using a recursive sql query

Nice find 👍 Perhaps you feel like sharing your results in case anybody else stumbles upon this ticket? :)

@titomiguelcosta
Copy link
Author

@clue Sure. Check the source code on my repository and feel free to play with it on the project page. You can create new graphs using an xml document, check out the example. And query the graph for all graphs or just the shortest one using json, one example here. Any feedback is more than welcome.

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

No branches or pull requests

2 participants