Learning Kruskal's Algorithm, Prim's Algorithm and Dijkstra's Algorithm by Board Game

Authors:
Wen-Chih Chang;Yan-Da Chiu;Mao-Fan Li
Affiliations:
Deparment of Information Management, Chung Hua University, Hsinchu, Taiwan, R.O.C.;Deparment of Information Management, Chung Hua University, Hsinchu, Taiwan, R.O.C.;Deparment of Information Management, Chung Hua University, Hsinchu, Taiwan, R.O.C.
Venue:
ICWL '08 Proceedings of the 7th international conference on Advances in Web Based Learning
Year:
2008

Citing 4
Cited 0

Computer Networking: A Top-Down Approach Featuring the Internet

Computer Networking: A Top-Down Approach Featuring the Internet
Game-first programming for information systems students

Proceedings of the second Australasian conference on Interactive entertainment
A board game for teaching internet engineering

ACE '06 Proceedings of the 8th Australasian Conference on Computing Education - Volume 52
Taking students out for a ride: using a board game to teach graph theory

Proceedings of the 38th SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.01

Visualization

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 the board game we choose and how to combine the game with before-mentioned three graph theories. At last, we would account for the advantage of combining with these three graph theories and the game specifically.