hi

[ankur patankar]

hi,
I am currently doing my btech final year project and we involves
searching of routes between two busstopes.
I was having trouble in getting the proper strategy to approach this
problem. I figured out that the best way to do this is to store the
data in graph where each node will be a bus stop and the edge between
the two nodes will represent bus route. As per my current approach am
thinking to implement it in djikstra a* algorithm and also am clueless
about how to store the graphical structure of bus information in the
form of a relational database like mysql.

Any guidance would be really helpful.
THanks n Regads,
Ankur

[Raxit Sheth <Mobile 4 Mumbai>]

Hey Ankur

This is Raxit from Mobile 4 Mumbai.
We are working and scaling to multiple cities and having small team.
(few from IIT, and we are working to get on board some iim folks as
well)

I request you to contact me on ra...@m4mum.com to discuss further.

PS : To all members of the group. This msg is after long time.
Please feel free to discuss your idea that is worth for Mumbai (and
India). I am still getting daily 10+ odd suggestions and to all we are
working on it. Some news will be out soon by next week !

Stay tuned

Raxit Sheth