What is pathfinding?

Example

Two routes from Ashford to Croydon. One uses a single relationship, the other costs less.

Breadth First Search returns Ashford to Croydon, which uses one relationship.

Dijkstra returns Ashford to Barnet to Croydon, which costs 5 instead of 10.

The lesson and course links below open in a new tab.

12 lessons use this term. Results are ordered by term density.

Algorithm CategoriesGDS FoundationsNode Similarity, KNN | | Pathfinding | What's the best4 mentions
Applying AlgorithmsGDS Foundationsdefine "importance" differently Apply community detection, similarity, pathfinding, and embedding algorithms Choose the right algorithm category based on your analytical3 mentions
Projection Configuration for AlgorithmsGDS FoundationsCommunity Detection — stronger connections keep nodes together Pathfinding — weights become distances/costs to minimise Similarity — higher weights increase similarity1 mention

Module recapEssential projection techniquesFind natural clusters and groups (Louvain, Leiden, Label Propagation) Pathfinding - Discover optimal routes through networks (Dijkstra) Similarity - Find structurally similar nodes (Node2 mentions
Module recap and what's nextWorking with algorithmsFind natural clusters and groups (Louvain, Leiden, Label Propagation) Pathfinding - Discover optimal routes through networks (Dijkstra) Similarity - Find structurally similar nodes (Node1 mention
Projection modeling for algorithmsEssential projection techniques(Dijkstra, Yen's) is best1 mention
Algorithms overviewWorking with algorithmsalgorithms find the shortest or best paths between3 mentions
Use GDS utility functionsWorking with algorithmswhen working with lists of node IDs (like from pathfinding1 mention

Understanding GraphRAGIntroduction to GraphRAGpatterns by following money or relationships across hops Network and pathfinding — find the shortest or strongest path between people, accounts, or systems Knowledge graphs for GraphRAG —2 mentions
Hack TimeTime to Build— find suspicious rings or patterns by following relationships Network and pathfinding — find the shortest or strongest connection between two things Text-to-Cypher agent — answer natural language1 mention

Introduction to Aura Graph AnalyticsAura Graph AnalyticsGDS Sessions Project the logistics network remotely from AuraDB Run pathfinding algorithms (Dijkstra, Yen's K-Shortest Paths) Compare historical routes against optimal paths Write results back1 mention
Dijkstra's Shortest PathAura Graph AnalyticsNetwork routing — Internet packet delivery Game AI — Character pathfinding Social networks — Degrees of separation (like our actor1 mention