Hello, I am new to Google Maps API and after reading about it Ive realized it should be very hard to implement a k-shortest simple path algorithm based on it because It would require access to the underlying map graph. I know google maps often offers alternatives paths given some start and end points but this solution is not enough for my plans. Does anyone figured out any way do accomplish such task using only the functions provided by Google API? I know that a lot of k-shortest simple path algorithms are based upon calling a shortest path routine avoiding some edge to be used, and this is exactly what I can't have Google API doing. During my master degree I've implemented some ksp algorithms and now I'd like to make it using real data.
Tks in advance. -- You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to google-maps-...@googlegroups.com. To unsubscribe from this group, send email to google-maps-api+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/google-maps-api?hl=en.
