3 ms·
> it must be a tree, not just a directed graph It may be a tree. But it must be a DAG (directed acyclic graph).
by viraptor 3y ago
> it must be a tree, not just a directed graph
It may be a tree. But it must be a DAG (directed acyclic graph).
- chasd00 3y agoHeh knowledge graphs sometimes don’t feel acyclic, at least not to me anyway. Sometimes I’m stuck bouncing back and forth :)
- galaxyLogic 3y agoit may be because the the "graph" is not accurate
- phinoda 3y agoIf it's prerequisite relationship, you need to make sure that when A points to B, and B points to C, C doesn't point to A. Otherwise you're creating a loop.
- galaxyLogic 3y agoRight, it must be acyclic. Which means it can be presented as a tree with some duplicate nodes. The important thing is the student must understand in which order they can try to understand the topics.
- phinoda 3y ago100% agreed