> [[Knowledge base]] HAS to be a [[Directed acyclic graph|DAG]]! There is quite a reasoning behind that [^1]: - each concept is a [[Composition|composition]] of more basic ideas (meaning broader set), so in other words it is [[Set intersection]] - in terms of quering you are interested in finding combinations of given ideas - you can create a [[Topological sort]] of ideas (not chronological) ## Example There is a problem actually with a differentation between a set and actual list of instances: ```mermaid graph TD Graph---GA[Graph algorithm] Algorithm---GA GA---BFS GA---DFS BFS---GAs[Graph algorithms as a composition] DFS---GAs ``` ^diagram It also presents that [[Singular or plural]] actually is not a case, as these both options do not represent the same set. [^1]: I came to these ideas sitting in [[ibis Styles Warszawa Airport]] during [[Warsaw 25' Nov]]