Fdtxjr

When a wind turbine does not produce enough electricity how does the power company compensate for the loss?

What can I do if someone tampers with my SSH public key?

Rationale to prefer local variables over instance variables?

How do we create new idioms and use them in a novel?

Does "Until when" sound natural for native speakers?

Why does cron require MTA for logging?

PTIJ: Why does only a Shor Tam ask at the Seder, and not a Shor Mu'ad?

Can I negotiate a patent idea for a raise, under French law?

Why do we say ‘pairwise disjoint’, rather than ‘disjoint’?

Can one live in the U.S. and not use a credit card?

Why restrict private health insurance?

What will happen if my luggage gets delayed?

Does an unused member variable take up memory?

Professor forcing me to attend a conference, I can't afford even with 50% funding

Can I use a violin G string for D?

Why is a very small peak with larger m/z not considered to be the molecular ion?

Windows Server Datacenter Edition - Unlimited Virtual Machines

Was it really inappropriate to write a pull request for the company I interviewed with?

Do I really need to have a scientific explanation for my premise?

Is it possible that a question has only two answers?

Can we track matter through time by looking at different depths in space?

Which situations would cause a company to ground or recall a aircraft series?

I reported the illegal activity of my boss to his boss. My boss found out. Now I am being punished. What should I do?

How to write a chaotic neutral protagonist and prevent my readers from thinking they are evil?

Transitive closure in bidirected graph

Amount of transitive relations on a finite setRevision Tracking GraphAre there any relations R of size 15 on the set 1, 2, 3, 4, 5, 6 such that R is both transitive and symmetric?How do you specify a link to a blind combinatorialist?Understanding relations when it's about $langlex,xrangle$ instead of $langlex,yrangle$What would make a function reflexive, transitive, and/or symmetric?In how many ways you can represent a graph ( data type )?Reflexive, symmetric and transitive closure of the following graphSpecial types of graph automorphismsHow to find the greatest and minimal element in the set of all transitive relations over $1,2,3,4$?

0

$begingroup$

I have big structure with data that relations with each other in my programm. I need to find all transitive relations for all items.
I duplicate all links and use transitive closure.
E.g.:

A --- B --- C
 |
 |
 D

Instead using pairs [A-B, B-C, B-D], I should use pairs [A-B, B-A, B-C, C-B, B-D, D-B]. It's big problem for me becouse datas have very big size.
Is there any alghoritms allows get all relations for each elements of graph without duplicates links?

discrete-mathematics graph-theory relations

share|cite|improve this question

asked yesterday

ekiryuhinekiryuhin

1

New contributor

ekiryuhin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

I have big structure with data that relations with each other in my programm. I need to find all transitive relations for all items.
I duplicate all links and use transitive closure.
E.g.:

A --- B --- C
 |
 |
 D

Instead using pairs [A-B, B-C, B-D], I should use pairs [A-B, B-A, B-C, C-B, B-D, D-B]. It's big problem for me becouse datas have very big size.
Is there any alghoritms allows get all relations for each elements of graph without duplicates links?

discrete-mathematics graph-theory relations

share|cite|improve this question

asked yesterday

ekiryuhinekiryuhin

1

New contributor

ekiryuhin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

I have big structure with data that relations with each other in my programm. I need to find all transitive relations for all items.
I duplicate all links and use transitive closure.
E.g.:

A --- B --- C
 |
 |
 D

Instead using pairs [A-B, B-C, B-D], I should use pairs [A-B, B-A, B-C, C-B, B-D, D-B]. It's big problem for me becouse datas have very big size.
Is there any alghoritms allows get all relations for each elements of graph without duplicates links?

discrete-mathematics graph-theory relations

share|cite|improve this question

asked yesterday

ekiryuhinekiryuhin

1

New contributor

ekiryuhin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

A --- B --- C
 |
 |
 D

share|cite|improve this question

asked yesterday

ekiryuhinekiryuhin

1

New contributor

ekiryuhin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

asked yesterday

ekiryuhinekiryuhin

1

New contributor

ekiryuhin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked yesterday

ekiryuhinekiryuhin

1

New contributor

ekiryuhin is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked yesterday

ekiryuhinekiryuhin

1