Fig. 3.

Efficient heuristic for shortest source-sink hyperpaths. Given source s, sink t, and edge weights $\omega$, function ShortestHyperpathHeuristic finds an s,t-hyperpath in hypergraph G, attempting to minimize its length. If no s,t-hyperpath exists, the empty path is returned. For doubly-reachable hyperedges e, the heuristic maintains fields e.length (the total weight of the shortest hyperpath found to e), and e.inedges (the subset of edges f with $\mathrm{head}(f)$ touching $\mathrm{tail}(e)$ where f.length is known), which are used in RecoverShortHyperpath to recover a short hyperpath to e