Shortest Path in Python

We are super excited to partner with DFW Pythoneers!

Description: Michael Ryan will be showcasing airplane route optimization using Neo4j's blazing fast graph database. He will take the example of air traffic and examine the fastest route using Yen’s k-shortest path algorithm. His demo uses a Jupyter notebook, where he explores, cleans up and analyzes a route and airport dataset. He then walks through how to apply data science algorithms on the graph database to find the shortest paths between locations.

Bio:
Michael Ryan is an engineer at Neo4j. Michael received his MS in Operations Research and BS in Mechanical Engineering from Southern Methodist University. At Neo4j, Michael's work spans working with machine learning models, demonstrating the value of graph databases, and enabling people with the skills of how to use a graph database.

The event is online and in-person, please register online at **DFW Pythoneers **to get the link to attend remotely.