Study on a Routing Algorithm Based on Ichnography

Deals with the computation of the shortest paths over a network of an ichnography to resolve the time complexity and space complexity problems in the shortest path searching algorithm. This algorithm is based on real network implementation. A new data structure is designed and a liner time and space expense is reached in searching for the shortest paths in a real network of ichnography. In this article, a strict demonstration is given to demonstrate the time and space expenditure.