Neo4j Live: Pathfinding Algorithms using Neo4j

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.

Check out community.neo4j.com (opens in a new tab) for questions and discussions around Neo4j