| http://www.w3.org/ns/prov#value | - This effectively means that only two small searches on the original cost raster are needed to connect s and d to the base level Ll, and from that level, they are connected to successively higher levels of the hierarchy.Once the graph structure Gt has been completed, calculating a path between s and d is a simple matter of running the A* algorithm on Gt.
|
