Dijkstra Shortest-path Algorithm

Documentation status: guide — see Maturity and evidence.

Dijkstra’s algorithm computes shortest paths from a source in a graph with non-negative edge weights. In logiCells documentation it should be treated as an algorithmic building block; conceptual identity and relation semantics remain separate from the traversal algorithm.