Explain about re of disjoint set union in daa
Answers
Answered by
0
plzzzzzzzzzz correct your question
plzzzzzzzzzz
plzzzzzzzzzz
plzzzzzzzzzz
plzzzzzzzzzz
plzzzzzzzzzz
plzzzzzzzzzz
Answered by
0
1. It can used for implementing Kruskal's algorithm to find the minimum spanning tree of a graph.
2. They are useful in applications like “Computing the shorelines of a terrain,” “Classifying a set of atoms into molecules or fragments,” “Connected component labeling in image analysis,” and others.[1]
3. Labeling connected components.
4. Generating a maze.
5. Alias analysis in compiler theory.
6. Maintaining the connected components of an undirected-graph, when the adges are being added dynamically.
2. They are useful in applications like “Computing the shorelines of a terrain,” “Classifying a set of atoms into molecules or fragments,” “Connected component labeling in image analysis,” and others.[1]
3. Labeling connected components.
4. Generating a maze.
5. Alias analysis in compiler theory.
6. Maintaining the connected components of an undirected-graph, when the adges are being added dynamically.
Similar questions