<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <http://katalog.ukdw.ac.id/id/eprint/1229> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Thesis> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/title> "KAJIAN PENERAPAN ALGORITMA A-STAR DAN DIJKSTRA UNTUK PENCARIAN RUTE TERPENDEK"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/ontology/bibo/abstract> "Masalah pencarian rute terpendek merupakan sebuah masalah yang sering ditemui dalam kehidupan sehari-hari. Tujuan pencarian rute terpendek dilakukan adalah untuk menghemat waktu, biaya serta tenaga. Dua algoritma yang dikaji dalam penyelesaian permasalahan pencarian rute terpendek yaitu algoritma A* dan\r\nalgoritma Dijkstra. Algoritma A* dan algoritma Dijkstra dikaji melalui beberapa jurnal yang dijadikan bahan literatur, analisis dan kajian pada bagian pembahasan. Berdasarkan pengkajian terhadap kedua algoritma tersebut maka dapat disimpulkan bahwa algoritma Dijkstra menerapkan prinsip greedy yang menginginkan semua, tidak selalu berhasil memberikan solusi optimum untuk\r\nkasus penentuan rute terpendek, sedangkan cara kerja algoritma A* berdasarkan fungsi heuristik dimana setiap node yang dikunjungi tidak lebih dari sekali. Berdasarkan fungsi heuristiknya maka algoritma A* lebih cepat dan tepat dari segi waktu dibanding algoritma Dijkstra."^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/date> "2018-02" .
<http://katalog.ukdw.ac.id/id/document/4604> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<http://katalog.ukdw.ac.id/id/document/4605> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> <http://xmlns.com/foaf/0.1/name> "Universitas Kristen Duta Wacana"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/issuer> <http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> .
<http://katalog.ukdw.ac.id/id/org/ext-b165542f6d5058d45c1c783c4e2af04b> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<http://katalog.ukdw.ac.id/id/org/ext-b165542f6d5058d45c1c783c4e2af04b> <http://xmlns.com/foaf/0.1/name> "Informatika, Universitas Kristen Duta Wacana"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/org/ext-b165542f6d5058d45c1c783c4e2af04b> <http://purl.org/dc/terms/isPartOf> <http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/issuer> <http://katalog.ukdw.ac.id/id/org/ext-b165542f6d5058d45c1c783c4e2af04b> .
<http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> <http://purl.org/dc/terms/hasPart> <http://katalog.ukdw.ac.id/id/org/ext-b165542f6d5058d45c1c783c4e2af04b> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/creator> <http://katalog.ukdw.ac.id/id/person/ext-theogratsia@gmail.com> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/ontology/bibo/authorList> <http://katalog.ukdw.ac.id/id/eprint/1229#authors> .
<http://katalog.ukdw.ac.id/id/eprint/1229#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <http://katalog.ukdw.ac.id/id/person/ext-theogratsia@gmail.com> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.loc.gov/loc.terms/relators/THS> <http://katalog.ukdw.ac.id/id/person/ext-d601706904f94503462e45056bffe30f> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.loc.gov/loc.terms/relators/THS> <http://katalog.ukdw.ac.id/id/person/ext-918eabdd63d21dd8b1667c7a5ee89d2a> .
<http://katalog.ukdw.ac.id/id/person/ext-theogratsia@gmail.com> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<http://katalog.ukdw.ac.id/id/person/ext-theogratsia@gmail.com> <http://xmlns.com/foaf/0.1/givenName> "Theogratsia Josepin Hehanussa"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-theogratsia@gmail.com> <http://xmlns.com/foaf/0.1/familyName> "71130162"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-theogratsia@gmail.com> <http://xmlns.com/foaf/0.1/name> "Theogratsia Josepin Hehanussa 71130162"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-918eabdd63d21dd8b1667c7a5ee89d2a> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<http://katalog.ukdw.ac.id/id/person/ext-918eabdd63d21dd8b1667c7a5ee89d2a> <http://xmlns.com/foaf/0.1/givenName> "Sri"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-918eabdd63d21dd8b1667c7a5ee89d2a> <http://xmlns.com/foaf/0.1/familyName> "Suwarno"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-918eabdd63d21dd8b1667c7a5ee89d2a> <http://xmlns.com/foaf/0.1/name> "Sri Suwarno"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-d601706904f94503462e45056bffe30f> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<http://katalog.ukdw.ac.id/id/person/ext-d601706904f94503462e45056bffe30f> <http://xmlns.com/foaf/0.1/givenName> "Joko"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-d601706904f94503462e45056bffe30f> <http://xmlns.com/foaf/0.1/familyName> "Purwadi"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/person/ext-d601706904f94503462e45056bffe30f> <http://xmlns.com/foaf/0.1/name> "Joko Purwadi"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> <http://xmlns.com/foaf/0.1/name> "Universitas Kristen Duta Wacana"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/creator> <http://katalog.ukdw.ac.id/id/org/ext-d11e32e2d183365a7c3e466ea93d65db> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ThesisEPrint> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/isPartOf> <http://katalog.ukdw.ac.id/id/repository> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://eprints.org/ontology/hasDocument> <http://katalog.ukdw.ac.id/id/document/4604> .
<http://katalog.ukdw.ac.id/id/document/4604> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://katalog.ukdw.ac.id/id/document/4604> <http://www.w3.org/2000/01/rdf-schema#label> "KAJIAN PENERAPAN ALGORITMA A-STAR DAN DIJKSTRA UNTUK PENCARIAN RUTE TERPENDEK (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/document/4604> <http://eprints.org/ontology/hasFile> <https://katalog.ukdw.ac.id/1229/1/71130162_bab1_bab5_daftarpustaka.pdf> .
<http://katalog.ukdw.ac.id/id/document/4604> <http://purl.org/dc/terms/hasPart> <https://katalog.ukdw.ac.id/1229/1/71130162_bab1_bab5_daftarpustaka.pdf> .
<https://katalog.ukdw.ac.id/1229/1/71130162_bab1_bab5_daftarpustaka.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "71130162_bab1_bab5_daftarpustaka.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://eprints.org/ontology/hasDocument> <http://katalog.ukdw.ac.id/id/document/4605> .
<http://katalog.ukdw.ac.id/id/document/4605> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://katalog.ukdw.ac.id/id/document/4605> <http://www.w3.org/2000/01/rdf-schema#label> "KAJIAN PENERAPAN ALGORITMA A-STAR DAN DIJKSTRA UNTUK PENCARIAN RUTE TERPENDEK (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://eprints.org/ontology/hasDocument> <http://katalog.ukdw.ac.id/id/document/4608> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://www.w3.org/2000/01/rdf-schema#label> "KAJIAN PENERAPAN ALGORITMA A-STAR DAN DIJKSTRA UNTUK PENCARIAN RUTE TERPENDEK (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://eprints.org/relation/isVersionOf> <http://katalog.ukdw.ac.id/id/document/4604> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://eprints.org/relation/isVolatileVersionOf> <http://katalog.ukdw.ac.id/id/document/4604> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://eprints.org/relation/isIndexCodesVersionOf> <http://katalog.ukdw.ac.id/id/document/4604> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://eprints.org/ontology/hasFile> <https://katalog.ukdw.ac.id/1229/3/indexcodes.txt> .
<http://katalog.ukdw.ac.id/id/document/4608> <http://purl.org/dc/terms/hasPart> <https://katalog.ukdw.ac.id/1229/3/indexcodes.txt> .
<https://katalog.ukdw.ac.id/1229/3/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://eprints.org/ontology/hasDocument> <http://katalog.ukdw.ac.id/id/document/4609> .
<http://katalog.ukdw.ac.id/id/document/4609> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://katalog.ukdw.ac.id/id/document/4609> <http://www.w3.org/2000/01/rdf-schema#label> "KAJIAN PENERAPAN ALGORITMA A-STAR DAN DIJKSTRA UNTUK PENCARIAN RUTE TERPENDEK (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://katalog.ukdw.ac.id/id/document/4609> <http://eprints.org/relation/isVersionOf> <http://katalog.ukdw.ac.id/id/document/4605> .
<http://katalog.ukdw.ac.id/id/document/4609> <http://eprints.org/relation/isVolatileVersionOf> <http://katalog.ukdw.ac.id/id/document/4605> .
<http://katalog.ukdw.ac.id/id/document/4609> <http://eprints.org/relation/isIndexCodesVersionOf> <http://katalog.ukdw.ac.id/id/document/4605> .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <https://katalog.ukdw.ac.id/1229/> .
<https://katalog.ukdw.ac.id/1229/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #1229 \n\nKAJIAN PENERAPAN ALGORITMA A-STAR DAN DIJKSTRA UNTUK PENCARIAN RUTE TERPENDEK\n\n" .
<https://katalog.ukdw.ac.id/1229/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<https://katalog.ukdw.ac.id/1229/> <http://xmlns.com/foaf/0.1/primaryTopic> <http://katalog.ukdw.ac.id/id/eprint/1229> .
<http://katalog.ukdw.ac.id/id/subject/QA75> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2004/02/skos/core#Concept> .
<http://katalog.ukdw.ac.id/id/subject/QA75> <http://www.w3.org/2004/02/skos/core#prefLabel> "QA75 Komputer Elektronik. Ilmu Komputer"@id .
<http://katalog.ukdw.ac.id/id/eprint/1229> <http://purl.org/dc/terms/subject> <http://katalog.ukdw.ac.id/id/subject/QA75> .