ScholarLens Back to search
2008•Microcomputer InformationRequires access

Study of Shortest Path Algorithm Model based on Half Space

Ang G

Open publisher page 0 citations

Abstract

In GIS field,there are more studies on shortest path problem and the application of it than the other presently.The efficiency problem of shortest path algorithm is a problem that is researched widely and needs to be solved imminently.Through analyzing the method of optimizing Dijkstra's algorithm for shortest path,algorithm based on half space for shortest path is put forward.And correlative program designed in VC++ environment,has validated the optimized algorithm effective.Applying this algorithm into Geographic Information System for Communal Query of JIAOZUO Citysystem,gains satisfying result.

About this research paper

What this paper is about

In GIS field,there are more studies on shortest path problem and the application of it than the other presently.The efficiency problem of shortest path algorithm is a problem that is researched widely and needs to be solved imminently.Through analyzing the method of optimizing Dijkstra's algorithm for shortest path,algorithm based on half space for shortest path is put forward.And correlative program designed in VC++ environment,has validated the optimized algorithm effective.Applying this algorithm into Geographic Information System for Communal Query of JIAOZUO Citysystem,gains satisfying result.

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

In GIS field,there are more studies on shortest path problem and the application of it than the other presently.The efficiency problem of shortest path algorithm is a problem that is researched widely and needs to be solved imminently.Through analyzing the method of optimizing Dijkstra's algorithm for shortest path,algorithm based on half space for shortest path is put forward.And correlative program designed in VC++ environment,has validated the optimized algorithm effective.Applying this algorithm into Geographic Information System for Communal Query of JIAOZUO Citysystem,gains satisfying result.

Key concepts: Shortest path problem, Yen's algorithm, Computer science, Dijkstra's algorithm, K shortest path routing, Shortest Path Faster Algorithm, Constrained Shortest Path First, Pathfinding

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Study of Shortest Path Algorithm Model based on Half Space — Research Paper | ScholarLens