2010
DOI: 10.4018/jmdem.2010100102
|View full text |Cite
|
Sign up to set email alerts
|

Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm

Abstract: The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works. In this paper, the authors introduce a competitive board game to motivate students to learn the concept of minimum spanning tree algorithms. They discuss the reasons why it is beneficial to combine graph theories and board game for the Dijkstra and Prim minimum… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…Each node intersection has weights that are calculated based on Euclidean Distance. For example, the weights from node 0 to 1 can be seen in the following calculations: [5] [6] 23,02 [5] [21] 18,03 [6] [4] 20,62 [6] [5] 23,02 [6] [9] 34,89 [6] [21] 25,32 [7] [0] 27,07 [7] [2] 30,07 [7] [8] 34,83 [8] [2] 20,22 [8] [7] 34,83 [8] [9] 33,06 [8] [11] 47,07 [8] [23] 26,25 [9] [4] 23,19 [9] [6] 34,89 [9] [8] 33,06 [9] [10] 40,31 [9] [11] 64,44 [9] [23] 19,85…”
Section: Resultsmentioning
confidence: 99%
“…Each node intersection has weights that are calculated based on Euclidean Distance. For example, the weights from node 0 to 1 can be seen in the following calculations: [5] [6] 23,02 [5] [21] 18,03 [6] [4] 20,62 [6] [5] 23,02 [6] [9] 34,89 [6] [21] 25,32 [7] [0] 27,07 [7] [2] 30,07 [7] [8] 34,83 [8] [2] 20,22 [8] [7] 34,83 [8] [9] 33,06 [8] [11] 47,07 [8] [23] 26,25 [9] [4] 23,19 [9] [6] 34,89 [9] [8] 33,06 [9] [10] 40,31 [9] [11] 64,44 [9] [23] 19,85…”
Section: Resultsmentioning
confidence: 99%
“…Some problems that have been studied in using Dijkstra algorithm, namely multi-hop calibration of the networked embedded system [5], achieving superior timing-driven routing trees [6], and adaptive protection in microgrids [7]. Discussion of the benefits of combining graph theories and board games for the Dijkstra and Prim minimum spanning tree theories have been conducted in introducing competitive board games to motivate students to learn the concept of minimum spanning tree algorithm [8]. The results of the priority search tree are purely functional, simple, and efficient have also been determined by Lammich et al theoretically, as well as their application in Prim and Dijkstra algorithms [9].…”
Section: Introductionmentioning
confidence: 99%