The document summarizes a proposed efficient route finder system that aims to minimize route re-computations and automatically processes road network data. It compares the proposed system to the Mumbai navigator in terms of lower space and time complexities. The proposed system uses Floyd-Warshall algorithm to pre-compute all-pair shortest paths and store them in a database to quickly return routes. Simulations show the proposed system requires less average time and space than Mumbai navigator as routes can be accessed from the database rather than recomputing each time. Future work will integrate GPS data and density-based transport management approaches.