四种算法求最短路径的例子，C#，图形演示
分别为贪心发，动态规划发，分支限界法，和回溯法-Four shortest path algorithm for example, C#, Graphical presentations were greedy fat, fat, dynamic programming, branch and bound method, and backtracking
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001572s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.091185s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001273s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001926s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001403s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005399s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001228s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.006966s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.019218s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001063s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 75169 [ RunTime:0.140154s ]
