假设清华校园内共有旅游景点N个（其中包括若干教学楼），赋予0到N-1的唯一编号。我们给出了每个景点的一个评分，以表示游客对其的评价。评分为0的景点表示的是教学楼（假设游客对教学楼是不感兴趣的），其他景点的评分均大于0。这些景点之间或者有直接道路相连，或者通过其他景点间接相连，景点之间的道路长度已知，道路总数为R。如图1所示，这里一共有10个景点（Si, i=0,„ ，9），每个景点的评分在节点中的括号中给出，如景点2的评分为3分，景点5（教学楼）的评分为0分。评分为0的景点为教学楼；其他景点为非教学楼。设计算法解决一些实际问题-Assuming that the Tsinghua campus Total tourist attractions N (including certain the teaching building), the unique number given 0 to N-1. We are given a score in each of the attractions to tourists to its evaluation. Rated 0 attractions are the teaching floor (assuming tourists on teaching building is not interested in), and other attractions score greater than 0. These attractions or the road connected directly or indirectly connected through other attractions, known attractions road length, road a total of R. As shown in Figure 1, where a total of 10 points of interest (Si, i = 0, " , 9), the score of each attraction are given in parentheses nodes such attractions score 3 points, Attractions 5 ( teaching building) score of 0 points. rated 0 Attractions teaching building　Other attractions in the non-teaching building design algorithms to solve some practical problems