2007•Journal of Zhengzhou University of Light IndustryRequires access

Improvement of Dijkstra algorithm and it's implementation in policy-GIS

Shenshen Li

Abstract

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.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dijkstra's algorithm, Computer science, Priority queue, Heap (data structure), A* search algorithm, Algorithm, Graph, Queue