mamat yg bernama dijkstra

aku rs dijkstra tu mcm nm org je (bese dlm fizik cmtu la)
anyway, sarin ckp:
dijkstra algo = restricted path
A* algo = open path

[link] contoh dijkstra in action in applet... tu yg xbest tu, applet huhu...
walaupon aku pki java 8/5, tp tah, mmg serius xmnt lgsg applet, bek pki jlnp (webstart) atau nk lg best javascript XD

papepon, yg pntg mnde ni mcm best :D n ada gak idea (bayangan/vision) A* dlm 3D
tp bygn je la, skang xtau lg cmne nk implement, xkn pki array kot hmm...

array/graph... graph mcm praktikal utk dijkstra, tp i have no idea cmne nk implement dlm java dan lum google lg (ada jmp package je la)

a* pki array ok kot, kalo kck2 je la.. tp bl consider nk pki array 3d, da mcm berat je tuh, kne pk2 lg (byk sgt pk, over-design huhu..)

so, kesimpulannya pki dijkstra utk road map, A* utk navigate dlm bgnn...

dan aku mcm da jd consultant java je nih (seswai la ngn peranan PLANT/SHAPER aku muakakaka)

No comments: