A topological ordering would be cool, too.
What's a topological ordering?
It's a linear ordering of the vertices of a directed acyclic graph, based on the dependencies.For example, consider the DAG:A -> BA -> CB -> DC -> DD -> ED -> FE -> FE -> GThen the sequence A,B,C,D,E,F,G is a valid topological ordering. So is A,C,B,D,F,E,G.Here are some useful notes and an algorithm.
Ah, so it's a total ordering that agrees with the dependencies. I am pretty sure that Spinoza's original ordering in the Ethics is like that--I have never seen an exception.
I updated this data to count postulates as a kind of axiom.
Post a Comment