The Heap™ – Consultancy ©®

« first day (3581 days earlier) ← previous day next day → last day (1279 days later) »

ypercubeᵀᴹ

12:00 AM

it's a math term

McNets

Clausura transitiva

ypercubeᵀᴹ

Transitive closure

In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive. For example, if X is a set of airports and xRy means "there is a direct flight from airport x to airport y" (for x and y in X), then the transitive closure of R on X is the relation R+ such that x R+ y means "it is possible to fly from x to y in one or more flights". Informally, the transitive closure gives you the set of all places you can get to from any starting place. More formally, the transitive closure of a binary relation R on a set X is the transitive...

check the graph theory part

McNets

@ypercubeᵀᴹ like a "path for all possible points that somehow are related" ?

ypercubeᵀᴹ

yeah

McNets

it's late, a tomorrow-work. nite all

ypercubeᵀᴹ

12:08 AM

Or the airplane connections example

> One example of a non-transitive relation is "city x can be reached via a direct flight from city y" on the set of all cities.
> The transitive closure of this relation is a different relation, namely "there is a sequence of direct flights that begins at city x and ends at city y".

2 hours later…

mustaccio

1:47 AM

As a contrarian, I say: good night.

Master Database

Q: Why does the search function not work as advertised?

When you click in the search bar it shows you these hints: I take to understand the highlighted one as this: the phrase in double quotes will search for the exact quoted literal. Not so, as the examples below show. Am I wrong thinking that this does not work as a reasonable person would expect...