Hi Francisco,
This sounds great!! I would be happy to help you guys in any way that i
can, be it to provide guidance on where to start or to review any
patches. Just let me know.
-Justin
Francisco Gabriel Malbrán wrote:
> Hi Jody
>
> I am currently working with a friend of mine with Geotools and the Graph
> extension in what is meant to be our degree thesis. We are developing a
> project for blinded people. What we will do, very soon I hope, is to develop
> a new algorithm ("new" = different from the Dijkstra one) for finding the
> shortest path between two nodes of a graph. This algorithm is known as
> A-Star (http://en.wikipedia.org/wiki/A_star) and we believe it could be nice
> if it is provided directly by the library.
> Reading your page and being tremendously obedient, here I am, making the
> first step of a list and hoping that you will be glad with our intentions.
>
> Best regards
>
> FranGM
>
>
>
> ------------------------------------------------------------------------
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by: Microsoft
> Defy all challenges. Microsoft(R) Visual Studio 2008.
> http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
>
> !DSPAM:4007,47a1e11b51511804284693!
>
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> Geotools-devel mailing list
> [email protected]
> https://lists.sourceforge.net/lists/listinfo/geotools-devel
>
>
> !DSPAM:4007,47a1e11b51511804284693!
--
Justin Deoliveira
The Open Planning Project
[EMAIL PROTECTED]
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Geotools-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/geotools-devel
