我会选择ILookup<int, int>
,但您还需要包含反向关联:
var result = sList.Union(sList.Select(p => new Pair { val1 = p.val2, val2 = p.val1 }))
.ToLookup(p => p.val1, p => p.val2);
您可以在没有 Linq 的情况下使用以下方法获得类似的结果:
var dict = new Dictionary<int, List<int>>();
foreach(var pair in sList)
{
if (!dict.ContainsKey(pair.val1))
{
dict[pair.val1] = new List<int>();
}
if (!dict.ContainsKey(pair.val2))
{
dict[pair.val2] = new List<int>();
}
dict[pair.val1].Add(pair.val2);
dict[pair.val2].Add(pair.val1);
}
上述两种方法都会生成一个Adjacency List,但是从您的评论来看,这听起来像是您想要做的更像是Connected Component Labeling
var groups = new List<HashSet<int>>();
foreach (var p in sList)
{
var merge = new List<HashSet<int>>();
foreach(var g in groups)
{
if (g.Contains(p.val1) || g.Contains(p.val2))
{
merge.Add(g);
}
}
if (merge.Count == 0)
{
var h = new HashSet<int>();
groups.Add(h);
merge.Add(h);
}
merge[0].Add(p.val1);
merge[0].Add(p.val2);
for(int i = 1; i < merge.Count; i ++)
{
foreach(int v in merge[i])
{
merge[0].Add(v);
}
groups.Remove(merge[i]);
}
}
当输入为
sList =
1 | 2
4 | 6
2 | 3
1 | 4
9 | 10
这将产生输出:
groups =
[ 1, 2, 3, 4, 6 ]
[ 9, 10 ]
然后将其转换为您想要的格式并不难:
var dict = new Dictionary<int, List<int>>();
foreach(var g in groups)
{
foreach(var v in g)
{
var list = new List<int>(g);
list.Remove(g);
dict.Add(v, list)
}
}
使用前面的示例:
dict =
1 | [ 2, 3, 4, 6 ]
2 | [ 1, 3, 4, 6 ]
3 | [ 1, 2, 4, 6 ]
4 | [ 1, 2, 3, 6 ]
6 | [ 1, 2, 3, 4 ]
9 | [ 9 ]
10 | [ 10 ]