Algoritma Prim: Perbedaan antara revisi

Jelajahi riwayat secara interaktif

← Revisi sebelumnya

Konten dihapus Konten ditambahkan

VisualTeks wiki

Revisi per 20 Juli 2017 13.58 sunting HsfBot (bicara \| kontrib) Bot 1.184.639 suntingan k Bot: penggantian teks otomatis (-algoritma, +algoritme) ← Revisi sebelumnya		Revisi terkini sejak 29 Desember 2022 08.25 sunting balikkan Hadithfajri (bicara \| kontrib) 952 suntingan Tidak ada ringkasan suntingan Tag: VisualEditor
(4 revisi perantara oleh 4 pengguna tidak ditampilkan)
Baris 44: == Rujukan == * R. C. Prim: ''Shortest connection networks and some generalisations''. In: ''Bell System Technical Journal'', 36 (1957), pp.  1389–1401 * D. Cherition and [[Robert Tarjan\|R. E. Tarjan]]: ''Finding minimum spanning trees''. In: ''SIAM Journal of Computing'', 5 (Dec. 1976), pp.  724–741 * [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 23.2: The algorithms of Kruskal and Prim, pp. 567–574. == Pranala luar == {{commons\|Category:Prim's Algorithm\|Prim's Algorithm}} * [http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Prim.shtml Minimum Spanning Tree Problem: Prim's Algorithm] {{Webarchive\|url=https://web.archive.org/web/20070505070612/http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Prim.shtml \|date=2007-05-05 }} * [http://www.cut-the-knot.org/Curriculum/Games/Mazes.shtml Create and Solve Mazes by Kruskal's and Prim's algorithms] at [[cut-the-knot]] * [http://students.ceid.upatras.gr/~papagel/project/prim.htm Animated example of Prim's algorithm] * [http://www.mincel.com/java/prim.html Prim's Algorithm (Java Applet)] {{Webarchive\|url=https://web.archive.org/web/20060712152157/http://www.mincel.com/java/prim.html \|date=2006-07-12 }} * [http://www.algorithm-code.com/wiki/Prim%27s_algorithm Prim's algorithm code] {{Authority control}} [[Kategori:~~Matematika~~Teori graf]]