الفهرس 
Introduction to the Shortest Path ProblemOnly 14 pages are availabe for public view
 |  | from | 138 |  |  |
| | | from | 138 | | |
Abstract
The shortest path problem lies at the heart of network flows and also the most commonly encountered problems in the study of transportation, communication networks and computer science. A closely related problem is the K shortest path problem, where theobjective is not only is not only to identify the shortes path, but also the second, the third,.., the Kth shortest path from node s to node t in a network. The purpose of this thesis is to study different techniques for solving the shortest path problem and compare their performance by implementing and testing them, then investigate the possible improvements on thes algorithms to increase their efficiency, and study different techniques for solving the Kth shortest path problem, and using it in an application to explain the useful of these algorithms.