# Find which path will not be included if we run Dijkstra on this graph?

**supriyas**#1

**shreya**#2

Node G is source

so we will visit all adjacnt

T(3),M(5),A(2)

then we take T

M(3+4 > 5 so keep 5),E(3+4)

we take M

A(5 + 6 > 2 so keep 2),E(5+5> 7 so keep 7),T(5 + 4 > 3 so keep 3)

then A

M(2 + 6 > 5 so keep 5),E(2 + 7 > 7 so keep E)

so Dijistras will return

GA,GM,GT,TE

so edge MA,AE,ME are not included.

I have not revised Dijistras but I think Im coorect.