path finding help
I'm at present working on a route finding system for the london underground as a MIDP application in
I have a vector of vectors data structure to store the staions as nodes and lines as edges respectively
but need a shorest path algorithm to search from one station to the next taking into account line changes.
Dijkstra's algorithm seems to be the best solution but hard for me to implement.
Any help on this would be most appreciated.
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL