Graph Algorithms: Dijkstra Shortest Path

Use this endpoint when you need single-source shortest paths or point-to-point routing on a graph with non-negative edge weights. It is faster than Floyd-Warshall for sparse graphs or when only one source is needed, and correct for all non-negative weight scenarios. Switch to Bellman-Ford (sibling endpoint) if negative weights are present, or Floyd-Warshall if all-pairs distances are needed.

• Source node not found in edge list — returns error requiring source to appear in edges
• Graph exceeds 200 nodes or 1000 edges — returns rejection with size limit error
• Edge list malformed or unparseable — returns parse error
• Negative edge weights present — endpoint redirects or advises use of /bellman-ford instead
• Target node unreachable from source — returns null distance and path
• Edge list exceeds 60000 character limit — returns error