A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A shortest path algorithm based on hierarchical graph model
This paper discusses a new algorithm for the shortest path founding based on hierarchical graphs. It plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. The calculation for the shortest path founding begins at the high-level graph. This method shrinks the searching range of the shortest path and reduces the time spending of calculating it. Since the impedance function among sub-graphs can be calculated dynamically, this algorithm can be applied to dynamic traffic inducement system.
A shortest path algorithm based on hierarchical graph model
This paper discusses a new algorithm for the shortest path founding based on hierarchical graphs. It plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. The calculation for the shortest path founding begins at the high-level graph. This method shrinks the searching range of the shortest path and reduces the time spending of calculating it. Since the impedance function among sub-graphs can be calculated dynamically, this algorithm can be applied to dynamic traffic inducement system.
A shortest path algorithm based on hierarchical graph model
Wu Yimin, (author) / Xu Jianmin, (author) / Hu Yucong, (author) / Yang Qinghong, (author)
2003-01-01
267743 byte
Conference paper
Electronic Resource
English
A Shortest Path Algorithm Based on Hierarchical Graph Model
| British Library Conference Proceedings | 2003
Optimal Water System Operation Using Successive Shortest Path Graph Algorithm
| British Library Conference Proceedings | 2014
Shortest viable path algorithm in multimodal networks
| Online Contents | 2001
| British Library Online Contents | 2013