Symbolic Dijkstra Shortest Path

Documentation status: reference — see Maturity and evidence.

A symbolic shortest-path operation applies weighted path search to a graph/hypergraph projection while retaining semantic constraints on admissible nodes/relations. Use only non-negative edge costs for standard Dijkstra semantics.