tutorials:xl-queries-and-operators
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
tutorials:xl-queries-and-operators [2025/05/31 17:51] – [Test model] rotated graph figure ksmolen | tutorials:xl-queries-and-operators [2025/06/02 07:36] (current) – added transitive closure examples ksmolen | ||
---|---|---|---|
Line 61: | Line 61: | ||
</ | </ | ||
- | The underlying 2d graph of the generated structure given below: | + | {{ :tutorials: |
- | {{ :tutorials: | + | The underlying 2d graph of the generated structure given below: |
- | Beginning from // | + | Beginning from // |
Line 202: | Line 202: | ||
</ | </ | ||
+ | ==== Transitive closure ==== | ||
+ | |||
+ | Transitive closure is a concept used to derive relations between successive nodes connected by several edges of the same type. For example, we want to find all descendants of some given node that are of type Internode. | ||
+ | |||
+ | The quantifier '' | ||
+ | |||
+ | * Find all internodes connected to the bud: | ||
+ | |||
+ | <code java> | ||
+ | (* Bud (<--)+ Internode *) | ||
+ | </ | ||
+ | |||
+ | Special syntax is used after the quantifier if we are interested only in finding minimal elements '': | ||
+ | |||
+ | * Find the first internode connected to the bud: | ||
+ | |||
+ | <code java> | ||
+ | (* Bud (<--)+ : | ||
+ | </ |
tutorials/xl-queries-and-operators.1748706711.txt.gz · Last modified: 2025/05/31 17:51 by ksmolen