Summary / 13. Planning / Document
2026-10-02
Shared copy: the operator's name and machine names are replaced by roles. Nothing else is changed.
Rendering…
You’re thinking of graph theory, specifically shortest-path algorithms. For getting from A to B, common methods are: - Dijkstra’s algorithm — shortest path when edge costs are nonnegative. - A* — shortest path using a heuristic, commonly used in GPS/navigation. - Bellman–Ford — shortest paths when negative edge weights are possible. The Travelling Salesman Problem (TSP) is different: find the shortest route that visits many locations and usually returns to the start. So if you mean “find the best route from A to B through a network,” the broad area is graph theory / pathfinding, usually Dijkstra or A*