[ÒÑ´¦Àí] ½¨Ò齫Qt´ÓÒÆ¶¯Æ½Ì¨×ªÒƵ½C/C++´ó°æ
ÉùÃ÷£º ÎÒ²»ÊÇÏ뼤Æðì¶Ü£¬ÒýÆðÁ½¸ö´ó°æÖ®¼äµÄÕ½Õù¡£ ÎÒÖ»ÊÇ´ÓCSDNºÍQt·¢Õ¹½Ç¶ÈÌá³ö¸öÈ˵Ľ¨Òé¡£ ΪºÎQt²»ÊʺϹéÊôÒÆ¶¯Æ½Ì¨´ó°æ£¿ ¢Ù Qt²¢²»×¨ÊôÒÆ¶¯Æ½Ì¨¿ª·¢£»Äã·ÅÔÚÒÆ¶¯Æ½Ì¨£¬Ï൱ÓÚËõСÁËQtµÄÓû§Èº£¡ ¢Ú ÒÆ¶¯Æ½Ì¨²»»ð±¬¡£¿´¿´Qt¿ª°æÕâô¾Ã£¬Ìû×Ӳš°¹²208 ƪ¡± ¢Û °ÑQtÍù¸÷´ó°æ¹ÒÁ´½Ó²¢Ã»ÓиÄÉÆÕâÒ»µã£ºÒòΪºÜ¶àÈ˲¢²»ÏëÔÚÒÆ¶¯Æ½Ì¨»ì¡£ ΪºÎQtÊʺϹéÊôC/C++´ó°æ£¿ ¢Ù QtʹÓÃC++ÓïÑÔ¿ª·¢£¬¶øÕâÀïC++Å£ÈËÖÚ¶à ¢Ú C/C++´ó°æÈËÆø¾ø¶Ô»ð±¬ ¢Û ÕâÀïÓкܶàѧÉú¼°³õѧÕߣ¬ËûÃÇÖ÷µ¼¿ª·¢½çµÄδÀ´ Ï£ÍûQtÂä»§C/C++´ó°æµÄ£¬Çë°ï¶¥Ï£¡
UP£¬ loaden °ïÎÒ¿´¿´http://topic.csdn.net/u/20100121/16/b9ace58a-88a9-4438-b8a0-c50d0371c2db.html?39832 10Â¥´úÂë¡£ÒýÓà UP£¬ loaden °ïÎÒ¿´¿´http://topic.csdn.net/u/20100121/16/b9ace58a-88a9-4438-b8a0-c50d0371c2db.html?39832 10Â¥´úÂë¡£ ²»ºÃÒâ˼£¬Ã»×¨ÃÅÑо¿ºÃ£¬²»¸ÒÂÒ˵ ^_^ ÄǾͼÌÐøÖ§³Ö µÈ ³¿ÐÇÀÏ´ó£¬Ôε쬰ï̳×ÓÀïÈËд¸öÕâôС´úÂ뿨סÁË¡£ÔçÖªµÀwininetÁË¡£ Ï£ÍûQtÂä»§C/C++´ó°æµÄ£¬Çë°ï¶¥Ï QtµÄÒâ˼¾ÍÊÇÆøËû pyQTÄØ... ÎÒÒ²ÔÚÕâÀïÖ§³Öһϰɣ¡ ×ð¾´µÄÓû§Loaden£¬ÄúºÃ£º Äú¿ÉÒÔÏȰÑÄúµÄÏë·¨ÓëC++´óС°æÖ÷ÃÇÌÖÂÛһϡ£½üÆÚÎÒÃÇÒ²»á¶ÔQt°æ½øÐÐÒ»´ÎͶƱ£¬×îºóÔÙÀ´¾ö¶¨ËüµÄλÖᣠ¸ÐлÄúÖ§³ÖCSDN ÉçÇø! Regards ==================================== Èç¹ûÎҵĻشðÒѾ½â¾öÁËÄú
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏ struct hostent *hp; char AlarmDevIP[20]; int x2; hp = gethostbyname("www.google.com"); if (hp) {
......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
´ó¼ÒºÃ£º ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿ ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......
°ï°ï棬лл~ 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 ......