hey guys i got this idea while studying the shortest path algos like djikstra nd warshall.
this can be done as a minor project... very simple thing to do.. we can write a symbian os program to find shortest path between 2 destinations on a map...... we will first have to make a map according to a scale, and then when the user enters the source and destination.. it will find out the shortest path between them using djikstra or warshall.......
we can also extend this algo to be of better use by also inculcating the traffic density, stoppages etc in the weigthage we give to each edge of the graph and then calculating the shortest path.....
i hope this is fine for minor projects......what do you think guys??......
Keywords: shortest path