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

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. © 2008 Springer-Verlag Berlin Heidelberg.