preorder
Verb
This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.002
Verb
preorder (preorders, present participle preordering; past and past participle preordered)
- (transitive) To order (goods or services) in advance, before they are available.
- (transitive) To sort or arrange beforehand.
- German: vorbestellen
preorder (plural preorders)
- An order for goods or services placed in advance.
- (set theory, order theory) A binary relation that is reflexive and transitive.
- The relation of logical implication over sentences is an example of a preorder.
- 2002, Yves Nievergelt, Foundations of Logic and Mathematics, Springer (Birkhäuser), page 152 ↗,
- Example 436 For each set A, the relation \subseteq is a preorder on \mathcal{P}(A).
- 2010, S. Kaci, Refined Preference-Based Argumentation Frameworks, Pietro Baroni, F. Cerutti, M. Giacomin, G. R. Simari (editors), Computational Models of Argument: Proceedings of COMMA 2010, IOS Press, page 306 ↗,
- Let us first compare S_1, S_2 and S_3 w.r.t. the partial preorder \succeq.
- 2000, Jean-Charles Pomerol, Sergio Barba-Romero, Multicriterion Decision in Management: Principles and Practice, Springer, Softcover, page 58 ↗,
- It can easily be verified that the above relation is a preorder, i.e. that it is reflexive and transitive.
- (binary relation that is reflexive and transitive) quasiorder
- preordered set
- German: Vorbestellung
- German: Präordnung
- Russian: предпоря́док
preorder (not comparable)
- (computing theory, of a traversal of a tree) Such that, recursively, the root is visited before the left and right subtrees.
- 2002, Gabriel Valiente, Algorithms on Trees and Graphs, Springer, page 115 ↗,
- Now, the preorder traversal of a tree can be constructed from the preorder traversals of the subtrees rooted at the children of the root of the tree.
- 2006, ISRD Group, Data Structures Using C, Tata McGraw-Hill Education, page 254 ↗,
- In the program given above, tree is constructed and is traversed in inorder, preorder and postorder traversal.
- 2011, Ananda Rao Akepogu, Radhika Raju Palagiri, Data Structures and Algorithms Using C++, Pearson Education India, page 9.16 ↗,
- The preorder traversal visits a node first after which it traverses its left subtree and then traverses its right subtree.
- 2002, Gabriel Valiente, Algorithms on Trees and Graphs, Springer, page 115 ↗,
This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.002