11-20, 09:45–09:50 (Pacific/Auckland), WG403
I developed a Python-based solution that extends QGIS routing capabilities by calculating longest paths in road networks using NetworkX and modified Dijkstra's algorithm. This approach transforms traditional shortest-path analysis into maximum distance exploration, could be applied in tourism route design and hydrological analysis.
This presentation demonstrates advanced network analysis methods using Python and NetworkX within QGIS to calculate the farthest reachable point from any starting location. Users can transform road network data into graph networks and visualize complex routing paths across geographic regions. This approach makes advanced network analysis accessible to GIS practitioners without requiring specialized graph theory knowledge.
A GIS Engineer at MIERUNE Inc. with interests in transportation, railways, and urban geography.