Ïë¸ã »ã±à£¬C\C++,ÊýѧӢÓïÒªµ½É¶Éî¶È£¿
Ïë¸ã »ã±à£¬C\C++,ÊýѧӢÓïÒªµ½É¶Éî¶È£¿
»ã±à£¬C\C++¸úÊýѧӢÓïÓÐɶ¹ØÏµ? ¸ßµÈÊýѧ£¬Êý¾Ý½á¹¹µÈ±ØÒªµÄ¶«Î÷Òª»á Ó¢ÓïÄÜ¿´¶®×ÊÁϾÍÐÐ Ó¢ÓïÎÒ2¼¶¶¼¹ý²»ÁË ÒÔǰÎÒѧÁËÕâЩºóÀÏÊÇÈÝÒ×Íü¼Ç£¬ÎÒ¾õµÃÄã¿ÉÒÔÑо¿²¡¶¾£¬È»ºó¾Í¿ÉÒÔÀ²¡£Õâ¸öÓ¦¸Ã˵ÊÇ×î¿ìµÄ·½·¨À²¡£ÓÐÒâ˼£¬»¹ÄÜѧ¶«Î÷¡£ LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË Â¥Ö÷ŬÁ¦°¡ÒýÓà LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË ¡Ñ﹏¡Ñbº¹ ÎÒרÃÅÀ´¿´5Â¥µÄ Â¥Ö÷£¬¾ÍÄãÒÔÄãÄÇÍæ¾¢ÎèÍŵÄÖÇÉÌÒ²Ïëѧ»á»ã±à¡£²»ÊǸçЦ»°Äã¡£ http://topic.csdn.net/u/20100123/11/1897eeb9-4303-408b-a0f9-b252c6a43c83.html?seed=725329011&r=63189890#r_63189890 Â¥Ö÷Á¬ÇàÄñµÄ»ù±¾¿Î³Ì¶¼Ñ§²»»á£¬×îºó°ÑÇàÄñ¶¼Âî½øÈ¥ÁË¡£ÒýÓà LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË Í¬Ò⣺LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË Ò»°ãÒ»°ã¾ÍOK ÓÑÇé °ï¶¥¡£ ÈÏʶӢÎÄ×Öĸ£¬ÄÜ¿´¶®ººÓïÆ´Òô Ë˵ÎÒÍæ¾¢ÎèÍÅ£¬ÎÒÃ»Íæ¡£¡£¡£¡£ ÖÐѧˮƽ¾Í¹»ÈëÃÅÁË£¬Ö®ºó°´ÐèÒªÔÙ²¹³ä ²»Ò»¶¨ÏÈÒª°ÑÊýѧѧµ½Ä³Ò»³Ì¶ÈÔÙѧ±à³ÌÒýÓà ÒýÓà 5 Â¥ vansbluge µÄ»Ø¸´: LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË Í¬Ò⣺LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË ìÅÎèµÄ°É.... ¿ÉÁ¯µÄÂ¥Ö÷£¬±»Î§Å¹ÁË£¬Í¬ÇéÏ ¹þ¹þ,LZ»»¸öÍ·Ïñ°É!ÄÇÑùÓ¦¸Ã¾ÍûÈË˵ÄãÁË!ÒýÓà LZ»¹ÊDz»ÒªÍæ¾¢ÎèÍÅÁË Ã¿Ìì»ØÌû¼´¿É»ñµÃ10·Ö¿ÉÓ÷֣¡Ð¡¼¼ÇÉ£º½ÌÄúÈçºÎ¸ü¿ì»ñµÃ¿ÉÓÃ·Ö <
Ïà¹ØÎÊ´ð£º
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿ ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡ ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð» mktime ......
°ï°ï棬лл~ 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 ......