Carol, that is really cool. Btw, Mattias Persson is looking for a good dataset to try bidirectional traversals for shortest paths etc, maybe you two could connect on your datasets to try these out? OSM and your project would be perfect I think!
Cheers, /peter neubauer G: neubauer.peter S: peter.neubauer P: +46 704 106975 L: http://www.linkedin.com/in/neubauer T: @peterneubauer If you can write, you can code - @coderdojomalmo If you can sketch, you can use a graph database - @neo4j On Sun, Jul 8, 2012 at 5:02 PM, Carol Hansen <carolbhan...@gmail.com> wrote: > Hello everyone, > > What did I do this week? > > Making progress on the OSM Routing Importer: > https://github.com/GretaCB/Routing-Project/blob/dc8c4dc3b49a6927f66c1f30d8b00c2d60ade9b2/neo4j/src/main/java/org/neo4j/neo4j/OSMRoutingImporter.java > Debugged my second parsing method. All node information is successfully set. > Read up on Traversing in Neo4j, and trying to Traverse the imported graph in > order to add distance between nodes...still struggling a bit with this. > Added WayID property between nodes. > > What will I be working on next week? > > Finish up OSM Importer > Start integrating Routing Algorithm > > Did I meet with any stumbling blocks? > > Taking longer than expected, and falling a bit behind schedule. I hope to > have the core of the API finished and to start integrating the Routing > Algorithms in Week 8. > Having a difficult time understanding the Traversal Framework API. Thank you > to Peter and Mattias for their input/tips! > > Thank you, > Carol Hansen > http://udig.refractions.net/confluence/display/HACK/Neo4j+Shortest+Path+API+for+OSM+data _______________________________________________ User-friendly Desktop Internet GIS (uDig) http://udig.refractions.net http://lists.refractions.net/mailman/listinfo/udig-devel
