Hi Justin and Jody as well. First of all, thank very much for answering so fast! Now back to business: Yesterday I was checking out the example about graph in the users guide. >From there and Jody's comment I thought that with a graph traversal and using features (and the getAtributte method) I could achieve the goal of finding a group of edges (here streets) with certain qualitities (for example, containing a specific address). This is true. I did it. Thing is I've used a BFS graph iterator, so I believe my search is lineal to the size of the graph (39520 edges and I dont remember how many nodes but near 25000) since a check out every node. Here two questions came up in my mind: 1. Is there a way of optimizing my search? 2. The search is (not for a very long time I hope) really poor in the sense of that for every node I'm watching all edges related to it. So clearly there are many edges that I check twice (if not all). I've seen that there is some kind of "visited" property for nodes and edges. Is there any place where I can find some example or documentation or hint about it? What I'm willing to do is that the method "getEdges()" of a node doesn't include the already visited edges in it's result.
Thanks again Fran PS: Very interesting the Geocoding issue. I believe I will need it as soon as I start trying to use path algorithms. -- View this message in context: http://www.nabble.com/Newbie-question-about-routing-tf4437632.html#a12676472 Sent from the geotools-gt2-users mailing list archive at Nabble.com. ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2005. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Geotools-gt2-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/geotools-gt2-users
