Guta, Berhanu (PhD)Brhane, Tsegay2018-07-192023-11-042018-07-192023-11-042011-01http://etd.aau.edu.et/handle/123456789/9347The complete set of this paper focuses on k-shortest path problem and algorithms which solve k-shortest path in a graph G where V is set of n nodes and E is set of m arcs. and I have discussed how to compute the first, second, third, k ht shortest path (in order) from the source node to every other nodes by using labeling algorithm which is label setting and label correcting algorithm and path removing algorithm in a given networkenRanked k-shorttestt patths iin nettworkRanked k-shorttestt patths iin nettworkThesis