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 the iterator seems to be doing most of the work. The question is why do you use the other two classes? In our case, the A star algorithm calculates a single path (the shortest one) between two nodes. It seems that a single "AStarShortestPathFinder" class would do it. It may probably be a design issue, and we can do the algorithm following that standard (the three classes one). Anyway it would be nice to know if it is necessary or what is better.
Thanks in advance Francisco jdeolive-2 wrote: > > 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 will have to go through a review, which myself or someone > else will be happy to do. > > Happy coding!! :) > > -Justin > -- View this message in context: http://www.nabble.com/Proposed-Graph-Extension-Contribution-tp15206560p15418983.html Sent from the geotools-devel mailing list archive at Nabble.com. ------------------------------------------------------------------------- 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
