Unity account

You need a Unity Account to shop in the Online and Asset Stores, participate in the Unity Community and manage your license portfolio. Create account

Language

Question by FaffyWaffles · Apr 29, 2022 at 05:12 AM · mesh graph edge detection union

Depth First Search vs Union By Rank and Path Compression

I'm trying to make an optimal algorithm for finding disjoint sets, and both of these are viable options. Generally speaking, w$$anonymous$$ch of these algorithms would be optimal, given either an Adjacency list or Matrix

alt text

amatrix.jpg (164.8 kB)

Add comment

Welcome to Unity Answers

If you’re new to Unity Answers, please check our User Guide to help you navigate through our website and refer to our FAQ for more information.

Before posting, make sure to check out our Knowledge Base for commonly asked Unity questions.

Check our Moderator Guidelines if you’re a new moderator and want to work together in an effort to improve Unity Answers and support our users.

Answers Answers and Comments

153 People are following this question.