2019
DOI: 10.1088/1742-6596/1280/2/022024
|View full text |Cite
|
Sign up to set email alerts
|

Designing futsal match finder application with floyd-warshall algorithm

Abstract: Information about the locations where futsal competition is taking place is needed for the futsal team to meet each other and compete. The purpose of designing Futsal Match Finder is to determine the position of futsal field location and help the shortest path to the field by implementing Floyd-Warshall algorithm. Application system design methodology that used in this research is prototype model. System test results show that the Floyd-Warshall algorithm can help find the shortest path to the location of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0
2

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 14 publications
0
4
0
2
Order By: Relevance
“…In the first iteration of k = 1, the data in the 0th row of the 0th column to the 8th column and the 0th row to the 8th-row column, and the x[i][j] row, with the provisions i = j with a value 0 (forming a diagonal line), the value was fixed. The value comparison iteration process was performed starting from x [1][2] up to x [8] [7], and the smallest value was selected.…”
Section: En-253mentioning
confidence: 99%
See 1 more Smart Citation
“…In the first iteration of k = 1, the data in the 0th row of the 0th column to the 8th column and the 0th row to the 8th-row column, and the x[i][j] row, with the provisions i = j with a value 0 (forming a diagonal line), the value was fixed. The value comparison iteration process was performed starting from x [1][2] up to x [8] [7], and the smallest value was selected.…”
Section: En-253mentioning
confidence: 99%
“…In addition, there are studies using chart diagrams and applying the Floyd-Warshall algorithm in route weight calculation, resulting in an application that searches for the shortest route on tourist attractions [6]. The application of a futsal match finder using the Floyd-Warshall algorithm on the map has also been studied [7]. Furthermore, other studies have employed several algorithms, including A*star, Djiskstra, Bellman-Ford, and Floyd-Warshall, to determine the shortest route [8]- [10].…”
Section: Introductionmentioning
confidence: 99%
“…Tidak banyak berbeda dengan penelitian Manaf dkk. yang merancang aplikasi pencarian tim futsal terdekat untuk berlatih tanding dengan menggunakan algoritma Floyd-Warshall [7]. Terdapat perbedaan antara penelitian ini dengan penelitian sebelumnya, seperti basis platform yang digunakan pada penelitian ini adalah Android dan pada penelitian ini memasukkan kategori umur untuk menyesuaikan lawan tanding.…”
Section: Pendahuluanunclassified
“…Pada tahapan ini dilakukan studi literatur yang berhubungan dengan subyek penelitian, yaitu dengan mempelajari hasil penelitian sejenis tentang aplikasi pencarian lawan latih tanding futsal yang sebelumnya pernah dilakukan oleh peneliti lain. Berdasarkan literatur yang didapat, yaitu penelitian oleh [4], [6], dan [7], kemudian dipelajari permasalahan yang muncul pada penelitian tersebut serta menganalisa solusi-solusi yang diberikan untuk mengatasi permasalahan yang ditemukan yang diteruskan dengan menentukan solusi yang tepat untuk mengatasi permasalahan pada penelitian ini sehingga didapatkan hasil (output) berupa aplikasi ALT+F untuk menemukan tim futsal sebagai lawan latih tanding.…”
Section: Pengumpulan Dan Pengolahan Dataunclassified
“…Researchers have applied the Floyd-Warshall algorithm to various fields and problems. Manaf et al used it to determine the location of a field in a five-player match, helping find the shortest path to the opposite five-player team position [30]. Wolfram et al applied it to detect closed-loop flow in power systems and solved the problem of the rapid increase in power flows faced by a transmission system [31].…”
Section: Shortest Path Algorithmmentioning
confidence: 99%