## K-DAG University

Last time I briefly described the knowledge in the form of a Graph structure. Each term having set of prerequisites is a node in this graph, each dependency is a directed edge in such graph. Now let’s assume this graph is a directed acyclic one and there are no terms which form a cycle of dependencies. In reality I don’t believe this to be true but it does simplify reasoning and can definitely be achieved locally for larger terms....