一道思索数年的小学题目
所在版块:求学狮城 发贴时间:2003-05-30 15:05

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
一. 一段经历: 思考数年的问题
初中时,妹妹问了我一个问题:
如下图,相邻2点的间隔是1,只能横连和竖连(当然,间距只能是1),你能一笔把这些点都连起来吗(不重复)?如果能,请,给出连的结果;如果不能,请给出理由.

当时我苦思冥想都没得到一个合理的结果来。直到进入高中后的某一天,我恍然大悟...

二. 数学转换
现在,我们把他转化成一道正规的数学题吧:
Does this graph have a Hamilton Path?


三. 一点引申:
Does this graph have a Hamilton Path?


试问:你能给出一个人人都懂的答案吗?
.
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!

编程 = ? ? = ? !
 相关帖子 我要回复↙ ↗回到正文
一道思索数年的小学题目 冷色蓝天   (724 bytes , 1010reads )
Newton knows the answer 顽哆拉   (0 bytes , 143reads )
答案就在下面的帖子里 冷色蓝天   (0 bytes , 177reads )
看来是公布答案的时候了 冷色蓝天   (264 bytes , 273reads )
还是哪位高人提出个答案统一一下吧 陀螺   (123 bytes , 321reads )
嗬嗬,知道了,原来好简单!!! 汪!   (0 bytes , 181reads )
dun have, becoz got points with odd linking MrDJay   (0 bytes , 198reads )
wrong... 冷色蓝天   (71 bytes , 213reads )
well, can group it and use peogeon hole to MrDJay   (94 bytes , 254reads )
not sure about your solution, pls enlighten me 陀螺   (40 bytes , 339reads )
如果不知道这个概念 冷色蓝天   (14 bytes , 189reads )
ha? is the simplified version of Euler circle? MrDJay   (203 bytes , 282reads )
wrong... 冷色蓝天   (131 bytes , 209reads )
ft 汪!   (66 bytes , 259reads )
我想   (160 bytes , 224reads )
ft,我的第一万贴阿!!不小心用错id了 汪!   (75 bytes , 203reads )
汪!汪! 乖乖龙   (0 bytes , 154reads )
well, you are right..:^P, mixing with Euler and He MrDJay   (17 bytes , 217reads )
some of your statement is wrong fool   (494 bytes , 240reads )
sorry, should be EXACTLY 2 odd vertex if it has MrDJay   (20 bytes , 200reads )
wrong again, fool   (94 bytes , 180reads )