Shortest path finder in a map (PROTOTYPE)

• 

  Map_Path_Finder

Inspiration

I always wanted to create a project that finds shortest path in a train network. This prototype is expected to be developed and improved in the coming years to include other cities train networks

What it does

This project creates a simple graph(mapy) with 5 nodes that are clickable by user. Output is the shortest path and the corresponding shortest distance. Implementation based on Dijkstra's Algorithm.

How we built it

Implementation of Dijkstra Algorithm in Visual Basic 2012

Challenges we ran into

Multiple run time error faces and making the project user foolproof, thinking of ways such that the user can use the software in a common sensed manner. Particularly hard to make the first click of a node be indicated as the first node selected in the checkbox array.

Accomplishments that we're proud of

The project worked.

What we learned

This is my first time developing a software/project and I find this to be a very exciting experience

What's next for Shortest path finder in a map (PROTOTYPE)

Expand it such that the prototype is developed into system maps of train networks for various cities around the world

Built With

• visual-basic