Union Find Disjoint Set data structure is used to represent connectivity between components. However the edges that are a part of it seem undirected ie the relation of connectivity is symmetric.
How can I design the Union Find data structure if the directions matter. Ie How can a directed graph be simulated into a UFDS data structure.
I found the following link but was unable to comprehend. Directed Union Find Disjoint Set
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | SecondThread | 150 |
| 7 | -is-this-fft- | 150 |
| 9 | pajenegod | 145 |
| 10 | BledDest | 144 |
→ Find user
→ Recent actions
Directed Graph with Disjoint Set Data Sructure
Revision en2, by Karan2116, 2016-01-16 10:27:46
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/17/2024 01:22:37 (i1).
Desktop version, switch to mobile version.
Supported by
