Title: Application of Extension Analytic Hierarchy Process in Spanning Tree
Abstract:Abstract In view of the problem how to choose the minimum spanning tree.firstly, a minimum spanning tree was found by using broken circle. Secondly connected graph was reduced to obtain a reduced grap...Abstract In view of the problem how to choose the minimum spanning tree.firstly, a minimum spanning tree was found by using broken circle. Secondly connected graph was reduced to obtain a reduced graph. Using broken circle method get all the minimum spanning tree, finally, it uses the extension analytic hierarchy process (EAHP), build the hierarchy, for all of the minimum spanning tree of outlier, aggregation coefficient, average path length, network sorting efficiency, optimal spanning tree, extension analytic hierarchy process provides the theoretical foundation for the screening of minimum spanning tree.Read More