BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//talks.staging.osgeo.org//foss4g-2025//talk//BYCVNH
BEGIN:VTIMEZONE
TZID:NZST
BEGIN:STANDARD
DTSTART:20000319T040000
RRULE:FREQ=YEARLY;BYDAY=3SU;BYMONTH=3;UNTIL=20070317T150000Z
TZNAME:NZST
TZOFFSETFROM:+1300
TZOFFSETTO:+1200
END:STANDARD
BEGIN:STANDARD
DTSTART:20080406T040000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=4
TZNAME:NZST
TZOFFSETFROM:+1300
TZOFFSETTO:+1200
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20001001T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=10;UNTIL=20060930T150000Z
TZNAME:NZDT
TZOFFSETFROM:+1200
TZOFFSETTO:+1300
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20070930T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=9
TZNAME:NZDT
TZOFFSETFROM:+1200
TZOFFSETTO:+1300
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-foss4g-2025-BYCVNH@talks.staging.osgeo.org
DTSTART;TZID=NZST:20251120T094500
DTEND;TZID=NZST:20251120T095000
DESCRIPTION:I developed a Python-based solution that extends QGIS routing c
 apabilities by calculating longest paths in road networks using NetworkX a
 nd modified Dijkstra's algorithm. This approach transforms traditional sho
 rtest-path analysis into maximum distance exploration\, could be applied i
 n tourism route design and hydrological analysis.
DTSTAMP:20260428T115205Z
LOCATION:WG403
SUMMARY:Finding the Farthest Point: Implementing Longest Path Analysis in Q
 GIS with NetworkX and Python - Xinmiao Qu
URL:https://talks.staging.osgeo.org/foss4g-2025/talk/BYCVNH/
END:VEVENT
END:VCALENDAR