Melola Discovery

← Melola Discovery

Jurnal

SIMULASI JARINGAN JALAN DI KOTA SEMARANG BERBASIS ALGORITMA FLOYD-WARSHALL UNTUK MENANGANI MASALAH LINTASAN TERPENDEK

Unnes Journal of Mathematics · Vol. 5 No. 2 (2017) · hlm. 153–160

DOI
10.15294/ujm.v5i2.13127
ISSN
2460-5859, 2252-6943
Terbit
2017-02-27
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

This study aimes to know the result of simulation program of road network by using Floyd-Warshall algorithm and visual basic programing. This study also aims to prove that the manual calculation is not different with the simulation of road networking in finding the shortest path of a graph. The method include (1) problem identification, (2) study of litetature, (3) data collection, (4) desainning and constructing simulation program, (5) implementasion of simulation, (6) evaluation of simulation program, (7) drawing conclution. Based on road network data of semarang city with is represented in a form of graph and running simulation Floyd-Warshall algorithm which is the result of desainning and creating the program by using visual basic programming. This simulation resulting shortest path for finding from start verteks to destination verteks after represented to simulation program.Based result manual calculation and the simulation Floyd-Warshall algorithm of this graph is not different

Jaringan kolaborasi para penulis

40 penulis · 173 tautan kepenulisan bersama · 10 lintas organisasi · menampilkan 40 yang paling banyak terhubung

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • State University of Semarang
  • International Islamic University Malaysia
  • Universitas Islam Nusantara
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Emi PujiastutiState University of Semarang8
Sugiman SugimanAfiliasi tidak diketahui7
Isnaini RosyidaAfiliasi tidak diketahui6
Kartono KartonoState University of Semarang6
Isnarto IsnartoState University of Semarang6
Scolastika MarianiState University of Semarang5
Sumartini SumartiniState University of Semarang5
Rochmad RochmadInternational Islamic University Malaysia5
Mashuri MashuriState University of Semarang5
Masrukan MasrukanState University of Semarang4
Mukh DoyinAfiliasi tidak diketahui3
U’um QomariyahAfiliasi tidak diketahui3
Riza ArifudinState University of Semarang3
Novira Rahmadian MahendraAfiliasi tidak diketahui3
Wardono WardonoAfiliasi tidak diketahui3
Endang SugihartiState University of Semarang3
Hardi SuyitnoAfiliasi tidak diketahui3
Isti HidayahState University of Semarang3
Adi Satrio ArdiansyahAfiliasi tidak diketahui2
Mahadi Dwi Mahadi Dwi HatmokoAfiliasi tidak diketahui2
Florentina Yuni AriniState University of Semarang2
Hanif Ilmi MardlootillahAfiliasi tidak diketahui2
Dwijanto DwijantoState University of Semarang2
Amin SuyitnoState University of Semarang2
Tri Sri Noor AsihAfiliasi tidak diketahui2
Herlina Ulfa NingrumAfiliasi tidak diketahui2
Zaenuri MasturAfiliasi tidak diketahui2
Mukeriyanto MukeriyantoAfiliasi tidak diketahui2
Muhamad Nurul HudaAfiliasi tidak diketahui2
Nur Karomah DwidayatiState University of Semarang2
Mohammad AsikinState University of Semarang2
Iwan JunaediState University of Semarang2
Nuriana Rachmani DewiAfiliasi tidak diketahui1
Widiyanto WidiyantoState University of Semarang1
Muhsin MuhsinUniversitas Islam Nusantara1
Ahmad NurkhinAfiliasi tidak diketahui1
Fachrurrozie FachrurrozieAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/sju/index.php/ujm/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 6 Nov 2026.
Metadata asli (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SIMULASI JARINGAN JALAN DI KOTA SEMARANG BERBASIS ALGORITMA FLOYD-WARSHALL UNTUK MENANGANI MASALAH LINTASAN TERPENDEK</dc:title>
	<dc:creator>Harsono, Harsono</dc:creator>
	<dc:creator>Mulyono, Mulyono</dc:creator>
	<dc:creator>Suyitno, Amin</dc:creator>
	<dc:description xml:lang="en-US">This study aimes to know the result of simulation program of road network by using Floyd-Warshall algorithm and visual basic programing. This study also aims to prove that the manual calculation is not different with the simulation of road networking in finding the shortest path of a graph. The method include (1) problem identification, (2) study of litetature, (3) data collection, (4) desainning and&amp;nbsp; constructing simulation program, (5) implementasion of simulation, (6) evaluation of simulation program, (7) drawing conclution. Based on road network data of semarang city with is represented in a form of graph and running simulation Floyd-Warshall algorithm which is the result of desainning and creating the program by using visual basic programming. This simulation resulting shortest path for finding from start verteks to destination verteks after represented to simulation program.Based result manual calculation and the simulation Floyd-Warshall algorithm of this graph is not different</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2017-02-27</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/sju/ujm/article/view/13127</dc:identifier>
	<dc:identifier>10.15294/ujm.v5i2.13127</dc:identifier>
	<dc:source xml:lang="en-US">Unnes Journal of Mathematics; Vol 5 No 2 (2016); 153-160</dc:source>
	<dc:source>2460-5859</dc:source>
	<dc:source>2252-6943</dc:source>
	<dc:source>10.15294/ujm.v5i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/sju/ujm/article/view/13127/7205</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2017 Unnes Journal of Mathematics</dc:rights>
</oai_dc:dc>