²é¿´: 1245  |  »Ø¸´: 6

napoleon_999

ľ³æ (СÓÐÃûÆø)

[ÇóÖú] Ò»µãСÒÉÎÊ ÒÑÓÐ1È˲ÎÓë

ÈçÌ⣬ÓÐÒ»µãСÒÉÎÊ£¬Èç¹ûÈÎÒâ¸øÄãÒ»¸ö¼òµ¥Í¼G£¬ÓÐûÓа취¹¹ÔìÒ»¸öͼG'£¬Ê¹µÃÕâÁ½¸öͼÂú×ãÒ»¸ö¹ØÏµ£¬¼´£¬Í¼Gº¬ÓÐÒ»¸ö¹þÃܶû¶ÙȦµ±ÇÒ½öµ±Í¼G'º¬ÓÐÒ»Ìõ¹þÃܶû¶Ù·£¬Çó´óÉñÖ¸½Ì£¡
»Ø¸´´ËÂ¥

» ²ÂÄãϲ»¶

ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

sskkyy

Òø³æ (ÕýʽдÊÖ)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
È¡G'ΪG¾Í¿ÉÒÔ¡£ÄãµÄÎÊÌâûÓн²Çå³þ°É£¬ÊDz»ÊÇ»¹ÓÐ ÆäËûÒªÇó£¿
2Â¥2015-11-05 23:10:18
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

napoleon_999

ľ³æ (СÓÐÃûÆø)

ÒýÓûØÌû:
2Â¥: Originally posted by sskkyy at 2015-11-05 23:10:18
È¡G'ΪG¾Í¿ÉÒÔ¡£ÄãµÄÎÊÌâûÓн²Çå³þ°É£¬ÊDz»ÊÇ»¹ÓÐ ÆäËûÒªÇó£¿

¿ÉÊÇǰһ¸öÊÇÒªÇó¹þÃܶû¶ÙȦ£¬ºóÒ»¸öÊÇÒªÇó¹þÃܶû¶Ù·°¡£¬ÕâÁ½¸öÊDz»Ò»ÑùµÄ
3Â¥2015-11-06 11:13:21
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

sskkyy

Òø³æ (ÕýʽдÊÖ)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

ÒýÓûØÌû:
3Â¥: Originally posted by napoleon_999 at 2015-11-06 11:13:21
¿ÉÊÇǰһ¸öÊÇÒªÇó¹þÃܶû¶ÙȦ£¬ºóÒ»¸öÊÇÒªÇó¹þÃܶû¶Ù·°¡£¬ÕâÁ½¸öÊDz»Ò»ÑùµÄ...

ÄãËùνµÄ¡±È¦¡°£¬Ö¸µÄÊÇloop£¬»ØÂ·£¿
¡°Â·¡±ÊÇpath?
4Â¥2015-11-06 12:19:20
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

napoleon_999

ľ³æ (СÓÐÃûÆø)

ÒýÓûØÌû:
4Â¥: Originally posted by sskkyy at 2015-11-06 12:19:20
ÄãËùνµÄ¡±È¦¡°£¬Ö¸µÄÊÇloop£¬»ØÂ·£¿
¡°Â·¡±ÊÇpath?...

ȦָµÄÊÇcycle,·ָµÄÊÇpath
5Â¥2015-11-06 20:21:15
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

hank612

ÖÁ×ðľ³æ (ÖøÃûдÊÖ)

¡ï ¡ï ¡ï ¡ï ¡ï
napoleon_999(feixiaolin´ú·¢): ½ð±Ò+5 2015-11-21 19:19:58
https://en.wikipedia.org/wiki/Hamiltonian_path_problem

There is a simple relation between the problems of finding a Hamiltonian path and a Hamiltonian cycle. In one direction, the Hamiltonian path problem for graph G is equivalent to the Hamiltonian cycle problem in a graph H obtained from G by adding a new vertex and connecting it to all vertices of G. Thus, finding a Hamiltonian path cannot be significantly slower (in the worst case, as a function of the number of vertices) than finding a Hamiltonian cycle. In the other direction, the Hamiltonian cycle problem for a graph G is equivalent to the Hamiltonian path problem in the graph H obtained by copying one vertex v of G, v', that is, letting v' have the same neighbourhood as v, and by adding two dummy vertices of degree one, and connecting them with v and v', respectively.

ÊÇÕâ¸ö¹ØÏµÃ´£¿

» ±¾ÌûÒÑ»ñµÃµÄºì»¨£¨×îÐÂ10¶ä£©

We_must_know. We_will_know.
6Â¥2015-11-08 03:16:26
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

napoleon_999

ľ³æ (СÓÐÃûÆø)

Ëͺ컨һ¶ä
ÒýÓûØÌû:
6Â¥: Originally posted by hank612 at 2015-11-08 03:16:26
https://en.wikipedia.org/wiki/Hamiltonian_path_problem

There is a simple relation between the problems of finding a Hamiltonian path and a Hamiltonian cycle. In one direction, the Hamiltonian path ...

ллÄãµÄ°ïÖú£¡²»ºÃÒâ˼£¬ÓÐÊÂÍâ³ö£¬°ÑÕâ²ç¸øÍüÁË¡£
7Â¥2015-11-20 13:28:17
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
Ïà¹Ø°æ¿éÌø×ª ÎÒÒª¶©ÔÄÂ¥Ö÷ napoleon_999 µÄÖ÷Ìâ¸üÐÂ
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] ²ÄÁÏÓ뻯¹¤¿¼Ñе÷¼Á +7 ‹üÈA 2026-03-22 7/350 2026-03-24 21:04 by greychen00
[¿¼ÑÐ] 0854È˹¤ÖÇÄÜ·½ÏòÕÐÊÕµ÷¼Á +3 ÕÂСÓã567 2026-03-24 3/150 2026-03-24 19:46 by zhouxuan..
[¿¼ÑÐ] ²ÄÁÏѧ˶333Çóµ÷¼Á +3 ±±µÀÏï 2026-03-24 3/150 2026-03-24 19:17 by pswait
[¿¼ÑÐ] 277·ÖÇóµ÷¼Á£¬¿çµ÷²ÄÁÏ +3 ¿¼Ñе÷¼Álxh 2026-03-24 3/150 2026-03-24 13:52 by JourneyLucky
[¿¼ÑÐ] Ò»Ö¾Ô¸¹þ¹¤´ó£¬085400£¬320£¬Çóµ÷¼Á +3 gdlf9999 2026-03-24 3/150 2026-03-24 10:08 by ²«»÷518
[¿¼ÑÐ] 284Çóµ÷¼Á +10 Zhao anqi 2026-03-22 10/500 2026-03-24 00:08 by Equinoxhua
[¿¼ÑÐ] Çóµ÷¼Á +7 Ê®Èý¼ÓÓÍ 2026-03-21 7/350 2026-03-23 23:48 by ÈÈÇéɳĮ
[¿¼ÑÐ] 384Çóµ÷¼Á +3 ×Óϵ²© 2026-03-22 6/300 2026-03-23 21:45 by ×Óϵ²©
[¿¼ÑÐ] 291 Çóµ÷¼Á +4 »¯¹¤2026½ì±ÏÒµÉ 2026-03-21 5/250 2026-03-23 16:46 by »¯¹¤2026½ì±ÏÒµÉ
[¿¼ÑÐ] ½ÓÊÕ2026˶ʿµ÷¼Á(ѧ˶+ר˶) +4 allen-yin 2026-03-23 6/300 2026-03-23 15:04 by Íô£¡£¿£¡
[¿¼ÑÐ] 317Çóµ÷¼Á +12 Éê×ÓÉêÉê 2026-03-19 18/900 2026-03-22 22:23 by luoyongfeng
[¿¼ÑÐ] 319Çóµ÷¼Á +4 СÁ¦Æøçæçæ 2026-03-20 4/200 2026-03-22 15:53 by ColorlessPI
[¿¼ÑÐ] Çóµ÷¼Á +3 .m.. 2026-03-21 4/200 2026-03-21 16:25 by barlinike
[¿¼ÑÐ] Ò»Ö¾Ô¸Î÷ÄϽ»´ó£¬Çóµ÷¼Á +5 ²Ä»¯ÖðÃÎÈË 2026-03-18 5/250 2026-03-21 00:26 by JourneyLucky
[¿¼ÑÐ] 296Çóµ÷¼Á +6 www_q 2026-03-18 10/500 2026-03-20 23:56 by JourneyLucky
[¿¼ÑÐ] 304Çóµ÷¼Á +7 ˾¿Õ. 2026-03-18 7/350 2026-03-20 23:08 by JourneyLucky
[¿¼ÑÐ] Ò»Ö¾Ô¸ ÄϾ©º½¿Õº½Ìì´óѧ´óѧ £¬080500²ÄÁÏ¿ÆÑ§Ó빤³Ìѧ˶ +5 @taotao 2026-03-20 5/250 2026-03-20 20:16 by JourneyLucky
[¿¼ÑÐ] Ò»Ö¾Ô¸ÄÏÀí¹¤085701»·¾³302Çóµ÷¼ÁԺУ +3 ¿ûè÷ÎÀ¶Ó 2026-03-20 3/150 2026-03-20 19:28 by zhukairuo
[¿¼ÑÐ] 0856µ÷¼Á£¬ÊÇѧУ¾ÍÈ¥ +8 sllhht 2026-03-19 9/450 2026-03-20 14:25 by ÎÞи¿É»÷111
[¿¼ÑÐ] ¡¾Í¬¼ÃÈí¼þ¡¿Èí¼þ£¨085405£©¿¼ÑÐÇóµ÷¼Á +3 2026eternal 2026-03-18 3/150 2026-03-18 19:09 by ²«»÷518
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û