Shortest Path Algorithms
Shortest Path Algorithms
Group 14
Introduction
● In this project we worked with shortest path algorithm where edge cost is vector rather than
scaler.
● We choose Jaipur city as our playground, where different nodes are different points in the city and
vertices is basically the path between them.
● We have two edge cost, first is the traffic between the two nodes and other is distance.
● Then we used shortest path algorithms and convolution method to find optimum path between
two user specified points.
Convolution Method
● We select a function which transforms vector weights into scalar weights.
● We have used Linear Convolution where scaler weight is calculated as linear combination of
vector weight combination.
(1,4)(jaipur junction) -> (2,5) -> (3,6) -> (3,7) -> (3,8)(chand pole) -> (4,9) -> (5,10) -> (6,11) -> (6,12) -> (6,13) ->
(5,14) -> (4,13) -> (3,14) -> (2,15) -> (2,16) -> (1,17) -> (1,18) -> (1,19)(LNMIIT)
Group Members