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

Chung-Hua University Repository > 資訊學院 > 資訊管理學系 > 研討會論文 > Item 987654321/31693

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://chur.chu.edu.tw/handle/987654321/31693

题名:	Learning Kruskal' s algorithm, Prim's algorithm and Dijkstra's Algorithm by board game
作者:	張文智 Chang, Wen-Chih
贡献者:	資訊管理學系 Information Management
关键词:	圖學;棋盤遊戲;遊戲式學習 Graph theory;board game;Game based Learning
日期:	2008
上传时间:	2014-06-27 01:35:04 (UTC+8)
摘要:	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
显示于类别:	[資訊管理學系] 研討會論文

文件中的档案:

档案	描述	大小	格式	浏览次数
LearningKruskal'salgorithm,Prim'salgorithmandDijkstra'sAlgorithmbyboardgame.pdf		27Kb	Adobe PDF	117	检视/开启

在CHUR中所有的数据项都受到原著作权保护.