APPLYING MINIMUM SPANNING TREE ALGORITHM (STA) FOR INTELLIGENT COMMUTER APPLICATION IN REAL-TIME ENVIRONMENT
BY
This project studies and develops an application which uses minimum spanning tree algorithm (STA) in helping commuters in the real-time environment. The application provides informative data for commuters who are traveling on public bus transport in a city. The application is able to find the minimum cost in term of distance or time, which would take a travel to a defined destination. It is also able to show a correct bus service to take and where to transit in order to reach the users selected destination. Each bus service provider offers a set of transportation routes throughout the country. Individual bus service or bus number travels in defined route, which make several stops during the journey at assigned bus stops. Bus service are frequently updated, removed or changed to adapt to the changing needs of the environment. Commuter have little knowledge of such changes; it is also impossible for any commuter to remember detail bus route of each individual bus services.
Full text source:
B. Sc. (Hons) In Software Engineering
August 2001
Number:
1-2