-
Notifications
You must be signed in to change notification settings - Fork 5
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
Directional Edges #77
Comments
Hello! Each path finding algorithm have a You can see more detailed example here. In general you just invoke methods trough var paths = G.Do.FindShortestPathsDijkstra(sourceNodeId,e=>1,pathType:PathType.OutEdges);
var pathToNode = paths.GetPath(targetNodeId);
|
Yeah, I believe you just using old version of library. I strongly recommend you to update to last nuget version. I will not lie - I was developing this library for my daily use and it is not backwards compatible. I will add readme to samples library with institutions how to run so you could play around with it and see how it works. And about positioning; I don't have documentation for this project, but I have samples that are small enough and could be run to understand how to work with library. I will update readme for samples RN |
Hello, I was trying to use your graph library to find the shortest way between multiple recipes.
It's for the following game:
https://neal.fun/infinite-craft/
The idea is that you can combine words to form other words. E.g.:
Fire + Water = Steam
And then:
Earth + Steam = Mud
I have created a Graph using your library which I'd like to use to find out what Path I should take.
The graph now uses intermediate nodes:
Earth => Earth+Steam => Mud
Steam => Earth+Steam
What I want is to have this directional though. Because you can not go from Mud back to Earth.
Is there a way to inform the Dijkstra shortest path finder to only use edges in a specific direction?
P.s. if you're interested in looking at my code / helping me solve it I can give you access. The repo is currently private.
The text was updated successfully, but these errors were encountered: