Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
I weakened the definition of covering relation for directed graphs so that satisfy the covering relation if their is an edge and no other path from to . The condition that there is no with edges and is too strong.
You mean too weak? Yes, that sounds quite reasonable, even before considering whether it gives us the right definition of Hasse diagram.
1 to 2 of 2