Hey greg;
You can create directional edges; and make use of that information when
navigating.
You can create an edge in each direciton that can be navigated (and then
just use dijkstra's as written)
I seem to recall a couple of classes in there that can be used for this
kind of thing ...
_greg
Anyone, anything... please.
_greg wrote:
>
> Hi all!
>
> I am starting to use geotools for my project and by now I have created
> working example that returns shortest path from point A to B for a given
> graph - I am using FeatureGraphGenerator.
>
> Now, my question is, how to create short
Hi all!
I am starting to use geotools for my project and by now I have created
working example that returns shortest path from point A to B for a given
graph - I am using FeatureGraphGenerator.
Now, my question is, how to create shortest path by using restrictions /
constraints such as: one way
