Fetch the repository succeeded.
// Copyright 2018 PingCAP, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// See the License for the specific language governing permissions and
// limitations under the License.
package disjointset
// IntSet is the int disjoint set.
type IntSet struct {
parent []int
}
// NewIntSet returns a new int disjoint set.
func NewIntSet(size int) *IntSet {
p := make([]int, size)
for i := range p {
p[i] = i
}
return &IntSet{parent: p}
}
// Union unions two sets in int disjoint set.
func (m *IntSet) Union(a int, b int) {
m.parent[m.FindRoot(a)] = m.FindRoot(b)
}
// FindRoot finds the representative element of the set that `a` belongs to.
func (m *IntSet) FindRoot(a int) int {
if a == m.parent[a] {
return a
}
m.parent[a] = m.FindRoot(m.parent[a])
return m.parent[a]
}
此处可能存在不合适展示的内容，页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容，可点击提交进行申诉，我们将尽快为您处理。
马建仓 AI 助手