跨树以查找遍历图的最小成本。一棵生成树 T 的无向图 G 是包括所有的是一棵树的 G thevertices 的子图。一般情况下，图可能有几个生成树，但未连接图中将不包含生成树 （但请参见跨越森林下面）。如果所有边缘 G 也跨越边缘树 G T 则 G 是一棵树，是与 T 相同 （即，一棵树上有一棵独特的生成树和它本身就是
文 件 列 表
spanning tree fourb.m gs.m lincomb.m mydet.m rot2d.m span.m transmat.m
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.006997s ]
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.104091s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001323s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001918s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001400s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.005717s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001326s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.006878s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015391s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001214s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 7806 [ RunTime:0.016667s ]
