?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=PENGGUNAAN+MODIFIED+PRIM+ALGORITHM+UNTUK+%0D%0AMENYELESAIKAN+MASALAH+BOUNDED+DIAMETER+MINIMUM+%0D%0ASPANNING+TREE+(BDMST)&rft.creator=Michael+Salim%2C+1717031040&rft.subject=510+Matematika&rft.description=ABSTRACT%0D%0APENGGUNAAN+MODIFIED+PRIM+ALGORITHM+UNTUK+%0D%0AMENYELESAIKAN+MASALAH+BOUNDED+DIAMETER+MINIMUM+%0D%0ASPANNING+TREE+(BDMST)%0D%0ABy%0D%0AMichael+Salim%0D%0APrim's++algorithm++is++one++method++to++solve++the++Minimum++Spanning++Tree++(MST)%0D%0Aproblem.+In+this+reasearch%2C+a+Modified+Prim+Algorithm+will+be+carried+out+to+solve+%0D%0Athe++Bounded++Diameter++Minimum++Spanning++Tree++(BDMST)++problem.++Modified+%0D%0APrim++Algorithm++is++done++by++adding++bounded++diameter++constraint++in++Prim+%0D%0AAlgorithm.++In++comparison%2C++we++are++using++the++python++program++to++facilitate++and+%0D%0Ashorten++the++time++to++implement++the++Modified++Prim++Algorithm++to++solve++BDMST+%0D%0Aproblems.++This++research++aims++to++develop++and++implement++BDMST++source++code+%0D%0Awith+Modified+Prim+Algorithm+on+complete+graph+data.+Then%2C+we+will+show+the+%0D%0Aproperties+of+BDMST+where+the+bounded+diameter+depends+on+the+order+(+)+of+the+%0D%0Acomplete+graph.++Obtaining+the+MST+solution+with+Prim+Algorithm+and+BDMST+%0D%0Awith++Modified++Prim++Algorithm%2C++obtained++the++larger++the++order++of++the++data++to++a+%0D%0Abounded+diameter+and+the+larger+the+bounded+diameter+to+an+order+the+BDMST+%0D%0Avalue+is+getting+closer+to+the+MST+value.+The+results+of+implementing+the+source+%0D%0Acode+in+this+study+show+that+the+BDMST+value+is+greater+than+or+equal+to+the+MST+%0D%0Avalue%2C+where+MST+is+the+lower+bound+of+BDMST.%0D%0AKeywords%3A++Prim+Algorithm%2C++Minimum+Spanning+Tree%2C++Modified+Prim+Algorithm%2C%0D%0ABounded+Diameter+Minimum+Spanning+Tree.%0D%0AABSTRAK%0D%0APENGGUNAAN+MODIFIED+PRIM+ALGORITHM+UNTUK+%0D%0AMENYELESAIKAN+MASALAH+BOUNDED+DIAMETER+MINIMUM+%0D%0ASPANNING+TREE+(BDMST)%0D%0AOleh%0D%0AMichael+Salim%0D%0AAlgoritma+Prim+adalah+salah+satu+metode+untuk+menyelesaikan+masalah++Minimum+%0D%0ASpanning++Tree++(MST).++Pada++penelitian++ini%2C++akan++dilakukan++Modified++Prim+%0D%0AAlgorithm++untuk+menyelesaikan+masalah++Bounded+Diameter+Minimum+Spanning+%0D%0ATree++(BDMST).++Modified+Prim+Algorithm++dilakukan+dengan+menambah+kendala+%0D%0Abounded++diameter++pada++Algoritma++Prim.++Penggunaan++program++python++untuk+%0D%0Amemudahkan++dan++mempersingkat++waktu++dalam++implementasi++Modified++Prim+%0D%0AAlgorithm++untuk++menyelesaikan++masalah++BDMST.++Tujuan++penelitian++ini+%0D%0Amengembangkan++serta++mengimplementasikan++source++code++BDMST++dengan+%0D%0AModified++Prim++Algorithm++pada++data++graf++lengkap.++Kemudian%2C++akan++ditunjukan+%0D%0Asifat-sifat++BDMST++dimana++bounded++diameter++bergantung++pada++orde++(+)++graf+%0D%0Alengkap.++Mendapatkan+solusi+MST+dengan+Algoritma+Prim+dan+BDMST+dengan+%0D%0AModified++Prim++Algorithm%2C++diperoleh++semakin++besar++orde++data++terhadap++suatu+%0D%0Abounded++diameter++dan++semakin++besar+++bounded++diameter++terhadap++suatu++orde+%0D%0Amenghasilkan++nilai++BDMST++semakin++mendekati++nilai++MST.++Hasil++implementasi+%0D%0Asource++code++pada++penelitian++ini++diperlihatkan++bahwa++nilai++BDMST++lebih++besar+%0D%0Aatau+sama+dengan+nilai+MST%2C+MST+adalah+lower+bound+dari+BDMST.%0D%0AKata++Kunci%3A++Algoritma++Prim%2C++Minimum++Spanning++Tree%2C++Modified++Prim+%0D%0AAlgorithm%2C+Bounded+Diameter+Minimum+Spanning+Tree.&rft.publisher=FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM&rft.date=2021&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F60892%2F1%2F1.%2520ABSTRAK%2520MICHAEL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F60892%2F2%2F2.%2520SKRIPSI%2520FULL%2520-%2520MICHAEL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F60892%2F3%2F3.%2520SKRIPSI%2520TANPA%2520MICHAEL.pdf&rft.identifier=++Michael+Salim%2C+1717031040++(2021)+PENGGUNAAN+MODIFIED+PRIM+ALGORITHM+UNTUK+MENYELESAIKAN+MASALAH+BOUNDED+DIAMETER+MINIMUM+SPANNING+TREE+(BDMST).++FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM%2C+UNIVERSITAS+LAMPUNG.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F60892%2F