Floyd算法在中心小学选址上的应用  

The Application of the Location of the Central Primary School based on Floyd Algorithm

作　　者：吴焕瑞[1] 贾艳军[1] 

机构地区：[1]保定学院数学与计算机系,河北保定071000

出　　处：《智能计算机与应用》2013年第2期80-81,85,共3页Intelligent Computer and Applications

基　　金：保定市教育科学"十一五"规划课题(103077)

摘　　要：中心小学选址是一个非常重要的问题。是将地理信息作为选址的主要依据,将几个相邻的村子的地理信息抽象成数学当中的图,然后用图论中求中心点和中位点的方法来确定中心小学的位置。在求中心点、中位点时要用到图论中最短路径算法,对经典的最短路径算法Floyd算法作了介绍。最后,用实例来分析中心点与中位点选址模型,并对中位点模型作了进一步分析。Taking geographic information as main location basis, it is an important problem that geographic information of several adjacent villages is abstracted to the topological graph, and uses the method for center point and median point to determine center primary school location. The shortest path algorithm in the graph theory is used while getting center point and median point. The paper presents the classical Floyd algorithm , and location model of center point and median point is analyzed in an example, furtherly analyzes median point model.

关 键 词：中心小学选址 FLOYD算法 最短路径 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]