23 ms·
> there are only three nontrivial complexity levels (2, 3, 4). That's only true if your dependency graph is planar. That said, the sentiment is spot on: you ca
by pdpi 9y ago
> there are only three nontrivial complexity levels (2, 3, 4).
That's only true if your dependency graph is planar. That said, the sentiment is spot on: you can get away with arbitrarily complicated code as long as you avoid embedding K_3,3 and K_5 in your dependency graph.