图论在单词接龙中的应用

The Application of Graph Theory in a Fan-tan Game

讨论了“单词接龙”的求解问题。运用图论中的欧拉定理建立了数学模型,并且设计了比较优化的算法,编制了程序。对任意一组单词,该程序可以判断出它们能否完成接龙。经测试,该算法较之传统的穷举法明显地降低了复杂度。

The math problem in a fan - tan game is discussed. By using graph theory to build a mathematical model and designing an effective algorithm to solve the problem, the program is done. This algorithm - based program can judge whether a group of words can be strung together. Following tests the method is found much less complex than the traditional method of exhaustion.