Find function with path-splitting optimisation
| 51 | |
| 52 | // Find function with path-splitting optimisation |
| 53 | PointId DisjointSet::find(PointId x) |
| 54 | { |
| 55 | PointId tmp = x; |
| 56 | while (tmp != m_parent[x]) |
| 57 | { |
| 58 | tmp = m_parent[x]; |
| 59 | m_parent[x] = m_parent[m_parent[x]]; |
| 60 | } |
| 61 | return tmp; |
| 62 | } |
| 63 | |
| 64 | // Merge y into x |
| 65 | void DisjointSet::unite(PointId x, PointId y) |