Dijkstra shortest path

anchor

Finds the cheapest path through a weighted graph. Applied to a representation, the graph is built from embedding similarity and the path cost becomes a measure of how far apart two points are in the model's internal geometry.

Findings