IDEAS home Printed from https://ideas.repec.org/a/igg/jmdem0/v1y2010i4p16-30.html
   My bibliography  Save this article

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

Author

Listed:
  • Wen-Chih Chang

    (Chung Hua University, Taiwan)

  • Te-Hua Wang

    (Chihlee Institute of Technology, Taiwan)

  • Yan-Da Chiu

    (Chung Hua University, Taiwan)

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.

Suggested Citation

  • Wen-Chih Chang & Te-Hua Wang & Yan-Da Chiu, 2010. "Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm," International Journal of Multimedia Data Engineering and Management (IJMDEM), IGI Global, vol. 1(4), pages 16-30, October.
    • Handle: RePEc:igg:jmdem0:v:1:y:2010:i:4:p:16-30
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jmdem.2010100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jmdem0:v:1:y:2010:i:4:p:16-30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.