Description: In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this.
File list (Check if you may need any files):
VojvodinaSaBgd.bmp
uDlgGrad.dcu
uKombi.dcu
uMain.dcu
uNapraviNaziv.dcu
uDlgGrad.dfm
uMain.dfm
PTP.dpr
PTP.dproj
PTP.identcache
PTP.dproj.local
uDlgGrad.pas
uKombi.pas
uMain.pas
uNapraviNaziv.pas
PTP.res
listagradova.str
PTP_project.tvsconfig
Download