3 ms·
I think if you want to represent dependencies by a graph, it should be a directed graph, not an undirected graph. I think once you put in direction, you will s
by gweinberg 9y ago
I think if you want to represent dependencies by a graph, it should be a directed graph, not an undirected graph.
I think once you put in direction, you will see that cycles are much more important than overlaps in edges in determining complexity. If you can keep the graph acyclic, life is pretty easy. I think big cycles are worse than small cycles, cycles that opverlap each other make things much more complex.
- jpfed 9y agoI wonder whether it would be possible to look at dependencies the way McCabe looked at flow control. http://www.literateprogramming.com/mccabe.pdf http://www.literateprogramming.com/mccabe.pdf That is, we use a strategy for substituting away subgraphs; we can classify programs by what results from that process. It may turn out that there are particular problematic subgraphs to avoid.
- chewxy 9y agoIt's also very helpful in discovering the best spots to test your code : https://blog.chewxy.com/2017/01/04/what-to-test/ https://blog.chewxy.com/2017/01/04/what-to-test/