摘要
以Hashtable类作为图的存储结构,使用二叉最小堆实现了最小优先队列,充分发挥MapOb-jects2组件和.NET框架的优势并将二者有机结合,对原始的Dijkstra算法进行改进处理,并应用于警用GIS中,提高了系统使用效率.
Hashtable was used to realize the storage structure of graph and binary minimum heap was used to realize the minimum priority queue. It fully develops the advantage of the combination of MapObjects2 component and . NET framework; makes improvement on the bases of classic Dijkstra algorithm. As a result, the searching efficiency has been enhanced and good effect in the policy- GIS achieved.
出处
《郑州轻工业学院学报(自然科学版)》
CAS
2007年第5期60-63,共4页
Journal of Zhengzhou University of Light Industry:Natural Science
基金
河南省教育厅自然科学研究计划项目(2006520024)
河南大学校内基金(重点理工科)项目(04ZDZR001)