°ïæ¿´¿´Õ⼸¸ö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£¿
ºÃ¶à´úÂë°¡
Ïà¹ØÎÊ´ð£º
дÁ˸ö²âÊÔ³ÌÐòÈçÏÂ
struct hostent *hp;
char AlarmDevIP[20];
int x2;
hp = gethostbyname("www.google.com");
if (hp)
{
......
ÈçÌ⣬C/C++ÖеÄexeclÔõôµ÷ÓÃдºÃµÄjava³ÌÐò£¬
execl("/opt/java1.5/bin/java","MyClass",NULL);
ÕâÑùµÄ²»ÐÐŶ¡£
²»»á.
ÔËÐÐjava³ÌÐò
ÕÒ¹¤¾ß²é¿´Ò»ÏÂÄǸö³ÌÐòµÄÃüÁîÐÐ
ËÑË÷Ï£ºjni ......
·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ
ѧϰ£¬¿´¿´
¼ÌÐø¶¥Å¶
ѧϰÁË¡£
go o ......
´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......