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