Scene Shortest Path Solutions Based on the Breadth First Search

Abstract:

Article Preview

Breadth first search is one of the most convenient traversal methods of a graph, and the shortest path problem of the city map is a kind of traditional data structure problems. It was researched and analyzed that the breadth first search traversing algorithm which adopting the adjacency matrix as its storage structure, in VC++6.0 environment, the shortest path problem of a city map was solved with breadth first search of the graph based on the queue, and its complete program was realized in the machine. Experimental results show that taking the breadth first search to solution city shortest path is an easy to understand and feasible scheme, so it has certain popularize value.

Info:

Periodical:

Edited by:

Yanwen Wu

Pages:

25-29

DOI:

10.4028/www.scientific.net/AMR.267.25

Citation:

J. H. Wen et al., "Scene Shortest Path Solutions Based on the Breadth First Search", Advanced Materials Research, Vol. 267, pp. 25-29, 2011

Online since:

June 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.