This example examines the two variants of a priority-first search: with accumulated weights, leading to shortest paths from start; with non-acumulated weights, leading to a minimum spanning tree.
()
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected