In this Neo4j live session, we will discuss pathfinding algorithms and their implementation using the Graph Data Science library in Neo4j over SpiceJet’s (one of India’s biggest airlines) airline network in India.
The different algorithms we will be exploring are
● Dijkstra algorithm
● All Shortest Path
● Yen’s K shortest algorithm
● Minimum Spanning Tree
● A Star algorithm
The session will include both the logical explanation (with example) alongside Cypher codes for
each algorithm.
Graph Analytics: Pathfinding algorithms using Neo4j blog: https://medium.com/data-science-in-your-pocket/graph-analytics-pathfinding-algorithms-using-neo4j-c9bda1915077
Full series:
https://medium.com/data-science-in-your-pocket/graph-analytics-part-1-891014c2dee4
LinkedIn:
https://www.linkedin.com/in/mehulgupta7991/
Check out https://community.neo4j.com/ for questions and discussions around Neo4j