roads

MaRDI QIDQ78130CRANFDO

Authors Kyle Lochhead, Josie Hughes, Sarah Endicott, Patrick Kirby

Last update 24 June 2023

Copyright license Apache License

Software version identifier 1.1.0, 1.0.0, 1.1.1

Description

Project road network development based on an existing road network, target locations to be connected by roads and a cost surface. Road projection methods include minimum spanning tree with least cost path (Kruskal's algorithm (1956) <doi:10.2307/2033241>), least cost path (Dijkstra's algorithm (1959) <doi:10.1007/BF01386390>) or snapping. These road network projection methods are ideal for use with land cover change projection models.

Cites work

• On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
• A note on two problems in connexion with graphs

This page was built for software: roads