shortest-path algorithm

noun
UK /ˈʃɔːtɪst pɑːθ ˈælɡərɪðəm/
US /ˈʃɔːrtɪst pæθ ˈælɡərɪðəm/

A set of steps a computer follows to find the quickest way from one place to another.

The map app uses a shortest-path algorithm to find the fastest route to the airport.

SYNONYMS

pathfinding algorithmroute-finding algorithmshortest route algorithmoptimal path algorithm

RELATED WORDS

graphnodeedgeDijkstra's algorithmnavigation

OTHER MEANINGS

2. A method for finding the least-cost sequence of connections between two points in a network.

The delivery company relies on a shortest-path algorithm to cut fuel costs.

3. A procedure in graph theory that computes the minimum total weight path between vertices.

Students implemented a shortest-path algorithm to solve the weighted graph problem.

4. A routing technique used in GPS and video games to move characters or vehicles efficiently.

The game's enemies use a shortest-path algorithm to chase the player through the maze.