[hardwired002]

hi guys, first of all, i wanna warn you that im just your average computer science student with fairly average knowledge so please dont be too "flashy" about your comments ok?

second, i wanna explain that i live in a city where the means of transportation are jeepneys (yes im in the Philippines). Each jeepney has its own route obviously. what i have in mind is to have a MAP/shortest-path problem application with its interface like that of google map. the scope of the application would just be 1 CITY for now.

1.) you enter your current location (should be in the CITY).
2.) enter your destination (in the CITY too obviously)
3.) the application will then calculate the shortest-path to that location but with the consideration of jeepney routes, therefore it also tells the user what jeepneys he should ride to arrive at his destination.

is this too easy or too hard? i mean i got like 5 months (spare time only, i still got other subjects) still.

any suggestions on where should i start? or any applications/topics similar to this so i can study as reference? im doing this in java btw

[mostyfriedman]

its not a bad project, shouldnt be too complicated. you will need strong graph theory.

[Brewer]

I agree with mostyfriedman, that sounds like a grand idea. I suppose there might already be something like this out on the market, but if there isn't this definitely sounds like it has money making potential.

[hardwired002]

thanks guys! you dont know how much your comments motivated me more!
i studied a bit of graph theory and know the basics of it.

now the question would be the approach and the coding part. im still thinking of some ideas

[macosxnerd101]

mostyfriedman, on 09 November 2010 - 07:52 AM, said:

its not a bad project, shouldnt be too complicated. you will need strong graph theory.

I definitely agree with mostyfriedman. I would check out Dijkstra's Algorithm for this project.