°ï°ï棬лл~
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~~~
ÕâЩһËÑÒ»´ó¶Ñ¡£´úÂ룬½Ì³ ......
±¾È˲»ÊÇÐÅÏ¢ÀàרҵµÄ£¬µ«¶ÔÕâ¸ö¸ÐÐËȤ£¬ÏÖÔÚ»¹²ËÄñ£¬ÏëÕÒ¸öÈËÒ»Æðѧ£¬Óн»Á÷Óнø²½¹þ
½»Á÷Ò»ÏÂ
ÈçºÎµÄѧϰ·½Ê½ÄØ£¿
ÎÒÒ²ÕýÓдËÒ⣬±¾È˼ÆËã»úרҵ£¬CÓïÑÔһֱûÓÐÈëÃÅ¡£
ÒýÓÃ
ÈçºÎµÄѧϰ·½Ê½ÄØ£¿
±ÈÈçÒ»Æð¿´Ð©Ê飬×öЩÌ⣬¼¸¸öÈËÒ»ÆðѧӦ¸Ã»á×¥µÃ½ôЩ
ѧϰ»¹µÃ¿¿×Ô¼º¡£ ¶à¿´¿´Êµ¼ÊµÄ´úÂë ÕâÑùѧ³öÀ ......
µ½Ä¿Ç°ÎªÖ¹£¬´òÌýµÄ10¼¸¸öµÄͬѧ£¬³ýÈ¥ÉÙÊý¡°¿´ÂÛÎÄ¡±µÄ£¬¾ø´ó¶àÊý¶¼ÊÇjavaºÍ½Å±¾£¬C/C++¾ÍÎÒÒ»¸ö£¬ÊÇÈÙÐÒ»¹ÊDZ¯°§¡¡
É¢·Ö¡¡
±ÏÒµÉè¼Æ»¹ÒªÖ¸¶¨ÓïÑÔ£¿£¡Ð´³ö¸öºÜ°ôµÄÈí¼þ²»¾Í¿ÉÒÔ£¿ÎÒÃǶ¼ÊÇ×ÔÎÒÑ¡ÌâµÄ;)
ÒýÓÃ
±ÏÒµÉè¼Æ»¹ÒªÖ¸¶¨ÓïÑÔ£¿£¡Ð´³ö¸öºÜ°ôµÄÈí¼þ²»¾Í¿ÉÒÔ£¿ÎÒÃǶ¼ÊÇ×ÔÎÒÑ¡ÌâµÄ;)
ÎÒÃǵıÏÒµÉ ......
ÈçÌ⣬ÎÒÓÃC#дµÄÒ»¸ö½â¾ö·½°¸£¬°üº¬ÁËC/SÈý²ã¼Ü¹¹£¬¹²5¸öÏîÄ¿£¬ÓõÄÊý¾Ý¿âÊÇSQL Server 2005£¬Windowsƽ̨µÄ¡£
ÎÊÌâÊÇ£º
1¡¢ÈçºÎ´ò°ü´Ë·½°¸£¬ÎÒÖªµÀÓз¢²¼£¬Ò²¿ÉÒÔн¨Ò»¸ö°²×°²¿ÊðÏîÄ¿£¬Ó¦¸ÃÓÃÄÄÒ»¸ö£¬ÕâÁ½ÖÖ·½·¨ÓÐÊ²Ã´Çø±ð¡£
2¡¢ÈçºÎ°ÑÕâ¸ö·½°¸²¿Êðµ½¾ÖÓòÍøµÄ·þÎñÆ÷ÉÏ£¬ÔÚ·þÎñÆ÷¶Ë¾ßÌåÓ¦¸ÃÔõôÅäÖá£
3¡ ......
XMLÎļþÈçÏÂ
<eventList>
<event>PD5,2009-11-20 </event>
<event>PD7,2009-11-21 </event>
<event>PD10,2009-11-22 </event>
</eventList>
MSûÓÐÏֳɵķ½·¨£¬×Ô¼ºÐ´·½·¨°É
http://www.vckbase.com/document/viewdoc/?id=1553
¿ÉÓÃPa ......
ÌâÄ¿ÊÇ£º±àдһ¸öº¯Êýstring_in,Ëû½ÓÊÜÁ½¸ö×Ö·û´®Ö¸Õë²ÎÊý¡£Èç¹ûµÚ2¸ö×Ö·û´®±»°üº¬ÔÚµÚÒ»¸ö×Ö·û´®ÖУ¬º¯Êý¾Í·µ»Ø±»°üº¬µÄ×Ö·û´®¿ªÊ¼µÄµØÖ·¡£ÀýÈ磬string_in("hats","at")·µ»ØhatsÖÐaµÄµØÖ·£¬·ñÔò£¬º¯Êý·µ»Ø¿ÕÖ¸Õë¡£
ÏÂÃæÊÇÎҵĴúÂ룺
#include <stdio.h>
#include <string.h>
......