°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ
°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program of the Floyd‐Warshall algorithm.
СÐı»·â£¬lz¿ÉÒÔʹÓÃgoogle~~~
ÕâЩһËÑÒ»´ó¶Ñ¡£´úÂ룬½Ì³ÌÓеÄÊÇ¡£¡£
1¡£±àдһ¸ö³ÌÐòÀ´Ö´ÐÐͼµÄÍØÆËÅÅÐò¡£
2¡£±àдһ¸ö³ÌÐòÀ´½â¾öµ¥Ô´×î¶Ì·¾¶ÎÊÌ⣨µÏ½Ü˹ÌØÀ
Ëã·¨£©¡£
3¡£Floyd-WarshallËã·¨
http://www.pudn.com/downloads117/sourcecode/math/detail497051.html
no.2
http://www.pudn.com/downloads34/sourcecode/windows/other/detail107640.html
http://www.ieee.org.cn/dispbbs.asp?boardID=60&ID=34040
http://download.csdn.net/source/1881314
google codeÉÏÃæºÜ¶àµÄ¡£
no.2
http://blog.csdn.net/akof1314/archive/2009/08/02/4400999.aspx
no.3
http://d.wanfangdata.com.cn/Periodical_aqsfxyxb-zrkx200804009.aspx
http://www.doc88.com/p-5750294608.html
http://www.lunwenall.com/University/2009-11-07/7935.html
ºÜ¶à£¬ÎҾͲ»Ò»Ò»ÁоÙÁË~~~~
no.3
http://www.cppblog.com/abilitytao/archive/2009/04/22/80747.html
1.
http://blog.csdn.net/chlaws/archive/2008/08/22/2816316.aspx
Â¥Ö÷£¬ÕÒ±¾Êé¿´¿´°É¡£
Ö±½ÓÇó´úÂëÒªËøµÄ£¬×Ô¼ºÐ´ÁËÓÐÒÉÎÊ¿ÉÒÔÀ´ÎÊ¡£
Ò»°ãÊý¾Ý½á¹¹µÄ½Ì³ÌÖж¼ÓÐ.
ÎÒ²»»áµÎ
ÄÜÓм¸¸öC£¿
ºÃ¶à´úÂë°¡
Ïà¹ØÎÊ´ð£º
QQȺ 29152388
ÓÑÇéUP
°ï¶¥
up
°ïup
up Ö§³Ö£¡
up jf
...ÄѵÀÓзÖ..?
up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£
Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ
¼ÓÁË¡£
¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö
µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡
ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î
http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎÑ¡Ò»»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Øת»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......