A 2-node graph has no degree>=2 candidates, so farthestPointAnchors returns empty before any Dijkstra runs and never reaches the overflow throw. Node 1 on a 3-node path is a candidate, so the selection pass actually exercises the law.
A 2-node graph has no degree>=2 candidates, so farthestPointAnchors returns empty before any Dijkstra runs and never reaches the overflow throw. Node 1 on a 3-node path is a candidate, so the selection pass actually exercises the law.