I have nodes representing bus stops, and relations representing bus connections with cost values representing minutes it takes for the bus to reach each stop. I'm currently using the A Star algorithm to find the quickest route for the bus routes. what is the best way to integrate the timetable data with a neo4j graph.
Route 117: (stop: 01) -mins:3 -> (stop:02) -mins:6 -> (stop:03) -mins:3 -> (stop:04) -mins:3 -> (stop:05) Route 203: (stop: 01) -mins:10 -> (stop:08) -mins:6 -> (stop:09) -mins:3 -> (stop:11) Route 302: (stop: 03) -mins:9 -> (stop:08) -mins:6.5 -> (stop:06) -mins:3.3 -> (stop:10) -mins:7 -> (stop:01) A trip could be on multiple bus routes e.g a user can get bus route 1 and change to bus route 3 at any stop to get the quickest route There are relationships between stops within walking distance, the cost is represented by walking time in minutes. The timetable is currently stored in SQL as: Route, Day, Stop #, Time 117, Monday, 1, 9:00 117, Monday, 2, 9:03 117, Monday, 3, 9:09 117, Monday, 4, 9:12 117, Monday, 5, 9:15 .. . 117, Monday, 1, 9:30 117, Monday, 2, 9:33 .. . 117, Monday, 1, 10:50 117, Monday, 2, 10:53 .. . If i have the timetable data as a property field for each node, can i use this data in the astar algorithm? Any help would be great Thanks _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
