There is a really complicated query, which I cannot wrap my head around alone. In the queried table there are 5 columns: PK_ID, which is the unique identifier of the value, ID, which connects the aggregated values in one group, the count, which says, how many value groups should be aggregated (if there aren’t enough, the group with such ID
Tag: graph-theory
How can i find all linked rows by array values in postgres?
i have a table like this: I want to find out which rows are in a group together. In this example 1,2,4 are one group because 1 and 2 have a common element and 2 and 4. 3 and 5 form a group because they have a common element. 6 Has no common elments with anybody else. So it forms
Summing edges properties for order by in select statement
I’m trying to do a select statement to order the result set by force of connections between them. ‘isConnectedTo’ edges relate Entities to another Entities The tricky part is I have double connections between the same entities as so: So Mike is connected to John which is connected to him too. Also Mike is connected to Susan. In this case