Khamayseh, Faisal; Arman, Nabil
(Journal of Theoretical and Applied Information Technology, 2015-06-10)
Given a graph G=(V,E,w), where V and E are finite set of vertices and edges respectively, is a directed weighted graph with weights denoted by w(e)>0 for each edge e ∈E. P(s,t) is the shortest path between the given vertices ...