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

View Sample PDF

Author(s): Wen-Chih Chang (Chung Hua University, Taiwan), Te-Hua Wang (Chihlee Institute of Technology, Taiwan)and Yan-Da Chiu (Chung Hua University, Taiwan)
Copyright: 2012
Pages: 15
Source title: Methods and Innovations for Multimedia Database Content Management
Source Author(s)/Editor(s): Shu-Ching Chen (University of Missouri-Kansas City, United States)and Mei-Ling Shyu (University of Miami, USA)
DOI: 10.4018/978-1-4666-1791-9.ch015

Keywords: Information Science Reference / Media & Communications / Multimedia Technology

Purchase

View Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm on the publisher's website for pricing and purchasing information.

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 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.

The IRMA Community

Research IRM

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

Purchase

Abstract

Related Content

IRMA Sponsors