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

CHUR > College Computer Science and Informatics > Department of Information Management > Journal Articles > Item 987654321/32867

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/32867

Title:	Board Game Supporting Learning Prim's Algorithm and Dijkstra's Algorithm
Authors:	張文智 Chang, Wen-Chih
Contributors:	資訊管理學系 Information Management
Keywords:	遊戲式學習;棋盤遊戲 Game;Learning;borad game
Date:	2010
Issue Date:	2014-06-27 02:07:27 (UTC+8)
Abstract:	這個概念的最小生成樹算法的數據結構是很難讓學生學習和想像沒有實踐。通常學習者需要圖中的生成樹與動筆劃出的實際教學活動體會到最小生成樹算法的工作原理。在本研究中，我們推出了有競爭力的棋盤遊戲激發學生學習的概念最小生成樹算法。我們討論的原因為什麼這是有利於結合圖論和棋盤遊戲的Dijkstra和Prim的最小生成樹理論。在實驗結果，我們證明了的棋盤遊戲，並檢查了學習反饋上述兩圖的理論，進一步總結了所帶來的優勢相結合，理論與棋盤遊戲。 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
Appears in Collections:	[Department of Information Management] Journal Articles

Files in This Item:

File	Description	Size	Format
BoardGameSupportingLearningPrim'sAlgorithmandDijkstra'sAlgorithm.pdf		27Kb	Adobe PDF	264	View/Open