4 ms·
What advantage do asymmetric connections give you? Does it enforce a hierarchy?
by theGnuMe 4y ago
What advantage do asymmetric connections give you? Does it enforce a hierarchy?
- 082349872349872 4y agobasically yes ==== pedantically no: antisymmetric connections give us an acyclic graph (DAG), whose reachability is a partial order. if we say there are always minimum and maximum elements (adding some[0] if needed), antisymmetric connections give us a graph where we can always find a least common superior and greatest common inferior. In the special case when a = lcs(a,b), we say that a is superior to b, and always find that also gci(a,b) = b, b is inferior to a. symmetric connections give us an undirected graph, whose reachability is an equivalence relation. (asymmetric is just not symmetric, which is a distinct notion) [0] eg under feudalism, we might say that all nobles are inferior to the divine, but any noble is superior to all commoners, so [divine,commoners] are our added maximum and minimum. Exercise: under what conditions is an acylic graph a tree; ie the DAG of antisymmetric connections is a hierarchy?
- theGnuMe 4y agoa rooted tree