![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
(The canonical location of this blog post is now Code filesystem trees & dependency digraphs on my web site.)
Consider a collection of source code. It's arranged in a structure in the filesystem. Often, each file is a module named according to its directory-and-file-path. The filesystem structure is a tree (which is a directed graph).
At the same time, the code forms a dependency tree/DAG. A module is a node, and a module importing another module forms an edge. Alternately, items in the code such as classes or functions can be nodes, and an item using another item forms an edge. This is usually a directed acyclic graph. In some cases, cycles are allowed.
In good code, is there a similarity between the filesystem structure and the dependency structure?
( Read more... )
Consider a collection of source code. It's arranged in a structure in the filesystem. Often, each file is a module named according to its directory-and-file-path. The filesystem structure is a tree (which is a directed graph).
At the same time, the code forms a dependency tree/DAG. A module is a node, and a module importing another module forms an edge. Alternately, items in the code such as classes or functions can be nodes, and an item using another item forms an edge. This is usually a directed acyclic graph. In some cases, cycles are allowed.
In good code, is there a similarity between the filesystem structure and the dependency structure?
( Read more... )
