Learning Kruskal' s algorithm, Prim's algorithm and Dijkstra's Algorithm by board game

CHUR > College Computer Science and Informatics > Department of Information Management > Seminar Papers > Item 987654321/31693

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

Title:	Learning Kruskal' s algorithm, Prim's algorithm and Dijkstra's Algorithm by board game
Authors:	張文智 Chang, Wen-Chih
Contributors:	資訊管理學系 Information Management
Keywords:	圖學;棋盤遊戲;遊戲式學習 Graph theory;board game;Game based Learning
Date:	2008
Issue Date:	2014-06-27 01:35:04 (UTC+8)
Abstract:	This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra’s, Prim’s, and Kruskal’s minimum spanning tree. Then it would describe the information about t This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra’s, Prim’s, and Kruskal’s minimum spanning tree. Then it would describe the information about t
Appears in Collections:	[Department of Information Management] Seminar Papers

Files in This Item:

File	Description	Size	Format
LearningKruskal'salgorithm,Prim'salgorithmandDijkstra'sAlgorithmbyboardgame.pdf		27Kb	Adobe PDF	118	View/Open