Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game

2012 ◽

pp. 256-270

Author(s):

Wen-Chih Chang ◽

Te-Hua Wang ◽

Yan-Da Chiu

Keyword(s):

Data Structure ◽

Spanning Tree ◽

Spanning Trees ◽

Minimum Spanning Tree ◽

Experimental Results ◽

Dijkstra’S Algorithm ◽

Board Game ◽

Tree Algorithm ◽

Dijkstra's Algorithm ◽

Tree Algorithms

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 spanning tree theories. In the experimental results, this paper demonstrates the board game and examines the learning feedback for the mentioned two graph theories. Advantages summarizing the benefits of combining the graph theories with board game are discussed.

Download Full-text

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

International Journal of Multimedia Data Engineering and Management ◽

10.4018/jmdem.2010100102 ◽

2010 ◽

Vol 1 (4) ◽

pp. 16-30

Author(s):

Wen-Chih Chang ◽

Te-Hua Wang ◽

Yan-Da Chiu

Keyword(s):

Data Structure ◽

Spanning Tree ◽

Spanning Trees ◽

Minimum Spanning Tree ◽

Experimental Results ◽

Dijkstra’S Algorithm ◽

Board Game ◽

Tree Algorithm ◽

Dijkstra's Algorithm ◽

Tree Algorithms

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 spanning tree theories. In the experimental results, this paper demonstrates the board game and examines the learning feedback for the mentioned two graph theories. Advantages summarizing the benefits of combining the graph theories with board game are discussed.

Download Full-text

Finding Shortest Path Basing on Dijkstra's Algorithm For Baghdad Universities by using Geographic Information System Applications

10.25212/icoit17.030 ◽

2017 ◽

Author(s):

Roaa Ebada Saeed ◽

Amer Saleem Elameer ◽

Rafah Shahab Alhamdani

Keyword(s):

Information System ◽

Geographic Information System ◽

Shortest Path ◽

Geographic Information ◽

Dijkstra’S Algorithm ◽

Dijkstra's Algorithm

Download Full-text

Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path

Public Transport ◽

10.1007/s12469-020-00253-x ◽

2020 ◽

Author(s):

Fredrik Ljunggren ◽

Kristian Persson ◽

Anders Peterson ◽

Christiane Schmidt

Keyword(s):

Experimental Evaluation ◽

Temporal Distance ◽

Dijkstra’S Algorithm ◽

Passenger Traffic ◽

Dijkstra's Algorithm ◽

Railway Timetabling

Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.

Download Full-text