| 图论在单词接龙中的应用 |
| |
| 引用本文： | 孙君意. 图论在单词接龙中的应用[J]. 北京联合大学学报(自然科学版), 2005, 19(3): 30-33 |
| |
| 作者姓名： | 孙君意 |
| |
| 作者单位： | 华中师范大学,信息技术系,武汉,430079 |
| |
| 摘 要： | 讨论了"单词接龙"的求解问题.运用图论中的欧拉定理建立了数学模型,并且设计了比较优化的算法,编制了程序.对任意一组单词,该程序可以判断出它们能否完成接龙.经测试,该算法较之传统的穷举法明显地降低了复杂度.
|
| 关 键 词： | 图论 欧拉路 单词接龙 图算法 |
| 文章编号： | 1005-0310（2005）03-0030-04 |
| 收稿时间： | 2005-04-06 |
| 修稿时间： | 2005-04-06 |
The Application of Graph Theory in a Fan-tan Game |
| |
| SUN Jun-yi. The Application of Graph Theory in a Fan-tan Game[J]. Journal of Beijing Union University, 2005, 19(3): 30-33 |
| |
| Authors: | SUN Jun-yi |
| |
| Abstract: | 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. |
| |
| Keywords: | graph theory Euler circuit fan-tan game graph algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
