Given a graph G, a unique source node s, find the shortest path to all reachable nodes.
This solver keeps a heap of arcs reaching from the "finalized label" nodes across the frontier of unlabeled and non-finalized nodes. Each iteration, the minimum cost non-permanently labeled node is permanently labeled, and the outbound arcs are added into the frontier heap.
Given a graph G, a unique source node s, and markers on the arcs indicating "active" or "inactive", find the shortest path to all reachable nodes using only "active" arcs.
This behaves exactly like the Dijksolver, except that it ignores "inactive" arcs.