先输入图的各顶点名，再输入图的邻接矩阵从而建立图，并用笛施卡尔，普里姆等三种方法求其最小生成树，-input vertices of the plan, and plans to import the adjacency matrix thereby establishing map, and use flute Shi Carl prim other three methods for the minimum spanning tree,
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001159s ]
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.074824s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001028s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001161s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001068s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003177s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000988s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.007343s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.019622s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001199s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 297813 [ RunTime:0.016737s ]
