Using the GDS Steiner Algorithm for Disney's 4 Park Challenge
summary
Uses the minimum directed Steiner tree implementation in Neo4j GDS on a hand-crafted graph created from Leaflet/OpenStreetMap waypoints plus themeparks.wiki POIs, with CSV import and GDS projection set to undirected. Edges use a time in seconds weight with multipliers for Skyliner/ferry/bus versus walking; source nodes are park transport stations and targets are icon photos, one ride and one food per park. Output reconstructs paths and estimates about 2 hours 45 minutes spent in transit/walking, showing measurable but improvable savings.
AI-written summary · about
chapters (14)
- 0:00Introduction to talk
- 0:25What is the FourPark Challenge
- 1:26Graph theory in Disney parks
- 2:08GDS Steiner algorithm explained
- 3:11Data collection process
- 4:14Graph model and optimization
- 5:41Projecting graph data
- 6:23Running the algorithm
- 7:04Demo of Steiner tree query
- 8:29Path optimization in Epcot
- 9:53FourPark challenge simulation
- 11:19Explore alternative routes
- 13:04Key takeaways and resources
- 13:45Q&A and closing
related talks
38mNeo4j for Solving Graph-Based Problems
11mSupercharged Dijkstra’s: Computing ‘shortest’ paths on large road...
22mFishing for routes: exploring an application of pgRouting
23mDataEngBytes 2023 - BRI-T1-11 - Lizzie MacNeill
27mDataEngBytes 2023 - PER-T1-03 - Lizzie Macneill
30mBeyond the Silos Achieving Data Harmony With Graph Based ER
32mGraph Databases, and Dungeons and Dragons
27mNeo4j GDS for Snowflake