Strict Weak Ordering in a Tree Data Structure

This post presents an idea of a strict weak ordering definition for elements in a set of nodes from a tree data structure. After presenting the main idea, there's an example of some XPath queries that could be used in an XML document to achieve this ordering plus some complexity notes on the algorithms. Assume [...]