¸÷λ´ó¸çÇë°ï°ï棬һ¸ö¼òµ¥µÄDelphi C/S½á¹¹³ÌÐò
СµÜ×î½ü¼±×Å×öÒ»¸öC/S½á¹¹µÄС³ÌÐò£¬¾ÍÊÇÔÚ¾ÖÓòÍøÄÚ£¬Ó÷þÎñÆ÷¶Ë³ÌÐòʵÏÖ·¢²¼ÐÅÏ¢ , ÐÅÏ¢±íÖ»ÐèÒª ±àºÅ(ID),·¢±íʱ¼ä£¨time£©ºÍÄÚÈÝ(Content) ¾ÍOKÁË£¬¿Í»§¶Ë°²×°ÔÚ¾ÖÓòÍøµÄÆäËüµçÄÔ£¬µ±ÕâЩװÓпͻ§¶ËµÄµçÄÔÆô¶¯ºó£¬×Ô¶¯ÔËÐпͻ§¶Ë³ÌÐò£¬µ¯³öÒ»´°¿ÚÏÔʾ×îÐÂÒ»ÌõÏûÏ¢ÄÚÈÝ£¡ СµÜÒòºÜ¾ÃÒÔǰѧ¹ýһЩDelphiµÄƤ룬ûÓÐ×ö¹ýC/S½á¹¹Á¬½ÓÊý¾Ý¿âµÄ³ÌÐò£¡ÔÚÍøÉÏËÑË÷Ïà¹ØÈëÃÅѧϰ×ÊÁÏÒ»¸öÉÏÎçҲûÓÐÒ»µãÍ·Ð÷£¬Ï£Íû¸÷λ´ó¸ç£¬°ïæ½²ÊöÒ»¸öÔõÑù´´½¨ÕâÑùÒ»¸ö³ÌÐò£¡Ô½ÏêϸԽºÃ£¬Ð¡µÜ²»Ð˸м¤¡£ÈçÄÜÌṩһЩÏà¹ØµÄѧϰÎĵµÒ²ÐУ¡ £¡Ï£Íû¸÷λ´ó¸ç°ï°ïæ
¿Í»§¶ËÁ¬½ÓÄã·þÎñ¶ËµÄÊý¾Ý¿â ²éÄãÒªÏÔʾµÄ¶«Î÷ ·þÎñÆ÷·ÅÊý¾Ý¿âºÍ·þÎñ¶Ë³ÌÐò£¬¿Í»§¶ËÖ»ÐèÒªÁ¬½ÓÊý¾Ý¿â¼´¿É£¬Á¬½Óºó¸ú²Ù×÷±¾µØÊý¾ÝÀàËÆ ÈκÎÒ»¸öÁ¬½ÓµÄÊý¾Ý¿â²Ù×÷¶¼ÄÜÂú×ãÄãµÄÐèÇó ÓÃsocket À´ÊµÏÖ¡£ ÓÃADO¾ÍÐа¡,Á¬½ÓÊý¾Ý¿âÖ®ºó¾ÍÐÐÁË.. Äܲ»ÄÜÂé·³¸÷λ´ó¸ç£¬¸øÒ»¸öÏà¹ØµÄʾÀý£¬»òÕßÏà¹ØµÄѧϰÎÄÕÂ×ÊÁϰ¡ ʵʱ·¢²¼¾ÍÓÃsocket Ö»ÊDz鿴Êý¾Ý¿â¼Ç¼ÄÇô¡°¿Í»§¶ËÖ»ÐèÒªÁ¬½ÓÊý¾Ý¿â¼´¿É£¬Á¬½Óºó¸ú²Ù×÷±¾µØÊý¾ÝÀàËÆ¡± ·Á˺ܶàÊ飬ÀûDCOMʵÏÖÁËÈý²ãϵͳ·þÎñÆ÷¶ËÀûÓÃADOÁ¬½ÓÁËÒ»¸öAccessµÄÊý¾Ý¿â£¬¿Í»§¶ËÁ¬½Ó¶ÁÈ¡·þÎñÆ÷¶ËÊý¾Ý£¬µ«Êǿͻ§¶ËÔÚ±¾µØ¿ÉÒÔʵÏÖÁ¬½Ó£¬¶ø¿½±´µ½¾ÖÓòÍøµÄÆäËüµçÄÔÔËÐÐÈ´Á¬½Ó²»ÁË·þÎñÆ÷£¿ÒýÓà ·Á˺ܶàÊ飬ÀûDCOMʵÏÖÁËÈý²ãϵͳ·þÎñÆ÷¶ËÀûÓÃADOÁ¬½ÓÁËÒ»¸öAccessµÄÊý¾Ý¿â£¬¿Í»§¶ËÁ¬½Ó¶ÁÈ¡·þÎñÆ÷¶ËÊý¾Ý£¬µ«Êǿͻ§¶ËÔÚ±¾µØ¿ÉÒÔʵÏÖÁ¬½Ó£¬¶ø¿½±´µ½¾ÖÓòÍøµÄÆäËüµçÄÔÔËÐÐÈ´Á¬½Ó²»ÁË·þÎñÆ÷£¿ Èç¹ûÖ»ÊǶÁÈ¡ºÍÏÔʾÏûÏ¢£¬ÓÃÁ½²ã¶¼¿ÉÒÔÁË Á¬½Ó²»ÁË·þÎñ¶Ë£¬ÄãÊÇÈçºÎÁ¬½ÓµÄ£¿
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏ struct hostent *hp; char AlarmDevIP[20]; int x2; hp = gethostbyname("www.google.com"); if (hp) {
......
hongqi162¡¢windindance ´Ë2È˳¤ÆÚ²»ÔÚÏߣ¬ÌرðÊÇwindindance ¸ü»»ÓÐÄÜÁ¦µÄÈËÉÏ hongqi162»¹ÊǾ³£ÉÏÀ´×ª×ªµÄ ÒýÓà ¸ü»»ÓÐÄÜÁ¦µÄÈËÉÏ ÆäʵҲ²»ÊÇʲôÄÜÁ¦µÄÔÒò£¬Ö÷Òª¿ÉÄÜÊÇʱ¼äÎÊÌâ°É ¹¤×÷µÄ»¹ÒªÉÏ°à£¬Ñ§Ï ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
°ï°ï棬лл~ 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 ......