福天使・ヨゥファン
Is there anybody knows which one is better between Dijsktra and Floyd~??
福天使・ヨゥファン
Based on their computation time and memory allocation~... youfan.webng.com/images/onion-tou/onion-096.gif
福天使・ヨゥファン
There's NO A* in the choice~... I just wanna analyze those 2 algorithms~... Not the A* algorithm~... youfan.webng.com/images/onion-tou/onion-047.gif
✖ exavolt ✖
votes for A*
福天使・ヨゥファン
No no nogh~... This isn't a vote for what's the best Path-finding algo~... This is about which one is better between Dijkstra and Floyd~...
✖ exavolt ✖
A*
福天使・ヨゥファン
pakcik
depend on
chocorobokun
sorry,ga bisa rekomendasiin apa2,soalnya yg saya mengerti baru Breadht-first/depth-first 
Clawford
agak beda bos. djikstra itu n2, floyd itu n3, djikstra itu one to all, floyd itu all pair shortest path. bedanya di dua itu.
Clawford
kira2 sih seperti itu.... udah agak lupa. terakhir pake 2 ini pas SMA >.<... tunggu om kiki aja dah...
福天使・ヨゥファン
Clawford
: How about the comparison of computation time and comparison of memory allocation~ Between both of them~ Which one is better~...
福天使・ヨゥファン
Jeez~ I think I should make the program to compare those 2 algos~...
Clawford
kalo computation time itu pake big O nya aja, Djikstra itu O(n^2), Floyd itu O(n^3), n itu jumlah node
Clawford
memory, djikstra itu n, sedangkan floyd itu n^2. n itu node * ukuran byte buat simpen address node
福天使・ヨゥファン
Udah Pak lynxluna~... O(n)~ O(n²)~ O(n³)~ O(2n)~ Ώ notation~ Θ notation~... Kalo cuma Sorting gampang~...
福天使・ヨゥファン
Lexicographic Sort = O(dT(n)) where T(n) is complexity of stable sorting time~... etc~
福天使・ヨゥファン
Unfortunately, yesterday, the algos that I wanna analyze aren't only Sorting algos but Path-finding algos~ More complex... 
福天使・ヨゥファン
Case already clear now~ 
--*Thread closed*--
--*Thread closed*--