%PDF-1.7
%
1 0 obj
<>stream
application/pdfOptimization of Dijkstra's Algorithm by Reducing the Number of IterationsChirag Desai , Param Mamania , Arya Karambelkar
A-PDF Watermark 4.7.6 ; modified using iTextSharp 4.1.6 by 1T3XTijert
endstream
endobj
2 0 obj
<>/Lang(en-US)/Pages 3 0 R/Metadata 1 0 R/Type/Catalog>>
endobj
3 0 obj
<>
endobj
4 0 obj
<>/Font<>/ExtGState<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI]>>/Contents[28 0 R 29 0 R 30 0 R 31 0 R 32 0 R 33 0 R 34 0 R 35 0 R 36 0 R 37 0 R 38 0 R 39 0 R 40 0 R 41 0 R 42 0 R 43 0 R 44 0 R 45 0 R 46 0 R 47 0 R 48 0 R 49 0 R 50 0 R 51 0 R 52 0 R 53 0 R 54 0 R 55 0 R 56 0 R 57 0 R 58 0 R 59 0 R 60 0 R 61 0 R]/Group<>/Annots[62 0 R 63 0 R 64 0 R]/Type/Page/Tabs/S>>
endobj
39 0 obj
<>stream
x=YܶgRZ8I(>җT*hwvw;:@Ǯ,SWY;$Ant7BE?ynuqZ,'/Ue5M͊PFd~
.'AӪ`JeQ˺x}n}U~8K.JR_p{-ߕ]Ci(f+Ui7wMSgWOʺMbX ul~7y<68rY/NW~xiQ6jl%-[Ruz}[YE ?%< m>.bU#vY t]-U`m8fB7 Q(Lؘ[-dY9a躰ק7k8EI2_t7ui'_W
$gJ!fV յ>ҊչJ
;sX(
OvJ
/~`t{{l> e5:MY7&!uY -Gj+qX4Ҍ
#y-Jn Ayؘn7{!hw%3p~Q3Aiup|sAi%DŽΣ"**]CD f7r@Y
nX@Wd/dVfR"P
ϯݙTd/* KCW֗Jp%OXC̿C"U^[UA}@j*rUJ6aPfdu%e{
,zk.i"u:rUO43ŅXB9.Z\Fr:^!W.8(Y_/55qCwvm..~@/_wO7?/X7,^'vK&'..e4fԂnO&QT*-رm9KͿ>;lQ98 .Ɖxc5.6p.6,R;&z'N hnw=EGym<ֱ9mKAB 74{qd}C[6(AJf+Ns{ۯ:H7zp`1p;P
'K[C cDͱ|t[Sfi}#v,J J%Yv)%ג(ܼer*ʣ@X\@uE
JΑ6^S&&c=f"!2
Bm uP¤!(}@xn}иjQꎴdHV4YJ A&
)Hdhx\^"1~! M˦V76IUWУ^ZQKRS|V2~]LJ:59+qn&lCSpӥEȲc)cr\ h}gU[HGUoKawd78
\84t{@lnEVSlFO/ZNO^xr>]9)Y-aRtȠ,
]B*}#=R32znWw-Xw=8kKv]vwDiFuc]/
@ŕw7=`Ax+ RV +їj@z6O_dnכSp&?&*?[xǡ^.M-t{7Q
,V _uN34\A}1@
[HIͧ2Iw dWv3QDvҹ3e [-dv[:8B!yAc](؋ϋuut$][\Gw W/pyeRw7F~ 6A&2Y_aT0zPɣU7\HMPn[jbA~$gH8ѯ{քD F4\9i4nB285ށQ9_gُ'c#q0\ϻFH.$~qA2y