5 ms·
DAG is directed acyclic graph. A bit like a tree where branches are allowed to merge but there are no cycles.
by tablatom 8mo ago
DAG is directed acyclic graph. A bit like a tree where branches are allowed to merge but there are no cycles.
- actionfromafar 8mo agoYes, but I was wondering how organize your code in a DAG.
- yorwba 8mo agoIdentifiers correspond to nodes and a mention of an identifier in the definition of another corresponds to a directed edge. The resulting graph won't necessarily be acyclic, but you can still use it to inform the order in which you present definitions, e.g. newspaper style starts with the most high-level function and puts the low-level details at the end: https://pypi.org/project/flake8-newspaper-style/ https://pypi.org/project/flake8-newspaper-style/
- michalsustr 8mo agoYes exactly! Good idea to extend it to functions as well