Dijkstra's algorithm vs transit algorithm
Shortest path problem is a problem that is relevant to a wide range of applications like traffic simulation and network routing. These applications play a huge part in our daily lives thus there is a need to explore algorithms which are faster and more efficient. This project explores and impleme...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/43895 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |