NODES 2025 - Using the GDS Steiner Algorithm for Disney's 4 Park Challenge

5.0 (1)

9 learners

What you'll learn

This course includes

51.3 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

neo4j graph databases graphs LLM retrieval augmented generation RAG vector database vector search GenAI AI Artificial intelligence nodes25

Full Transcript

Earlier in the year, Eric did Walt Disney World's 4 Park Challenge, visiting all four parks in one day, taking a photo with a park icon (e.g., Cinderella's castle), having a snack or meal, and riding a ride in each park. But did he do it optimally? He doesn't know! In order to find out, we'll explore how to navigate the parks optimally using one of the GDS Steiner Tree algorithms and determine whether he really needed to walk all of those steps. Speaker: Eric Monk View Presentation: https://drive.google.com/file/d/1bkIMAUy5FXpQgpu6I-kMHccckHj8HsN2/view?usp=drive_link Resources: Get Started with Aura - https://bit.ly/3LOLrjh Deployment Center - https://bit.ly/4jOelM3 Ground AI Systems and Agents with Neo4j - https://bit.ly/4oVsnyb #nodes2025 #neo4j #graphdatabase #graphrag #knowledgegraph