Hi Francisco,
Nice to hear from you again! And great work on the contribution and
tests. I have committed your work to the code base. From the jira report
I assume you are working on 2.4.x? So I have added the classes to 2.4.x
and every branch forward.
Thanks again, and I hope you continue to
Hi Justin! we have just commented on the jira issue and uploaded some tests
Best regards
Francisco
Justin Deoliveira-4 wrote:
>
> Hi Francisco,
>
> I have looked over the code and commented on the jira issue.
>
> -Justin
>
> Justin Deoliveira wrote:
>> Thanks Adrian. And nice work Fran. As
Hi Justin. I've seen your message and answered it.
Thank you very much for being so active in this matter.
Sorry about the timing.
Regards
Francisco
jdeolive-2 wrote:
>
> Hi Francisco,
>
> I have looked over the code and commented on the jira issue.
>
> -Justin
>
> Justin Deoliveira wrote
Hi Francisco,
I have looked over the code and commented on the jira issue.
-Justin
Justin Deoliveira wrote:
> Thanks Adrian. And nice work Fran. As Adrian says attach your code to a
> jira report and I will be happy to look it over.
>
> -Justin
>
> Adrian Custer wrote:
>> That sound fantastic
Thanks Adrian. And nice work Fran. As Adrian says attach your code to a
jira report and I will be happy to look it over.
-Justin
Adrian Custer wrote:
> That sound fantastic.
>
> The best way to submit the work is to open a JIRA bug:
> http://jira.codehaus.org/
> (sorry, can't find the
That sound fantastic.
The best way to submit the work is to open a JIRA bug:
http://jira.codehaus.org/
(sorry, can't find the GEOTOOLS specific link so you'll have to
make sure to pick the right project)
and attach your patch(es) to that bug.
congratulations,
--adrian
On Fri,
Hi there.
Well. finally we've made up two classes: the AStarShortestPathFinder and the
AStarIterator. It works in an analogous way that of Dijkstra. No original
GeoTools code modified.Shall I send those to your personal emails?
Best Regards
Francisco
--
View this message in context:
http://www
Hi Justin.
Watching the code of the Graph extension we've seen that you basically make
use of three classes to program the Dijkstra shortest path algorithm.
Namely: DijkstraIterator, DijkstraShortestPathFinder, and
BasiGraphTraversal.
The code is very clear and we understand it. The thing is that
Hi Francisco,
We usually dont just hand commit access out. The norm is a user submits
a few bugs or patches and once he has gained the confidence of a module
maintainer that person can be nominated for commit access.
So by all means feel free to play with code... but any actual
modifications w
Sounds good; justin can you see that Francisco is set up with svn
access; has a tour of the developers guide and so on.
Jody
> 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.
Well is great to "hear" that!
Thing is how to go on. We have an idea of what the code must be. In the near
future we will probably ask you some particular questions.
So, reading the website, we've seen we must respect some style and other
issues. I've also read that you work with svn.I don't think
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
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 findin
Thanks Francisco; welcome to GeoTools. I am not sure if the graph module
has well defined plug-ins yet .. so it may be that you need to work
right in the graph module. Lets wait until we here back from the Justin
(aka the module maintainer).
Sounds like interesting work.
Jody
Francisco Gabriel
14 matches
Mail list logo
