Full material
₦ 5,000 $(29)
| Pages | 157 |
| Delivery | Instant, after payment |
Project Details
| Department | Computer Science |
| Type | Project |
| Pages | 157 |
| Reference Style | YES |
| Format | MS Word & PDF |
| Reference No. | CPU1733 |
Abstract
ABSTRACT This study is concerned with the design of a Decision Support System for finding the Shortest path to a destination. The objectives of the study is to determine the optimal shortest/fastest path to a given destination or optimal shortest distance/fastest time to a given destination amongst others. The shortest path algorithm used is Dijkstra’s algorithm with finite nodes in the road network for optimum performance. Hence, the system developed in this study, seeks for an optimal solution by decomposing the original problem into several interconnected sub-problems according to hierarchy…
This is a preview.Unlock the full abstract, all chapters and references.
Unlock Full Material
Full material
₦ 5,000 $(29)
| Pages | 157 |
| Delivery | Instant, after payment |