Memory fault on simple graphj
Created by: emden
2.40.1 dot crashes on
digraph G {
a -> b
{rank = sink c }
}
This works in 2.38. It also works if newrank=true.
The fault occurs during positioning, not ranking. The graph given to rank2 is not connected, though the new feasible_tree() routine explicitly requires this.
Interesting that the old network simplex worked with disconnected graphs.