本文整理汇总了C#中System.Collections.Generic.ToUndirectedGraph方法的典型用法代码示例。如果您正苦于以下问题：C# System.Collections.Generic.ToUndirectedGraph方法的具体用法？C# System.Collections.Generic.ToUndirectedGraph怎么用？C# System.Collections.Generic.ToUndirectedGraph使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类System.Collections.Generic的用法示例。
在下文中一共展示了System.Collections.Generic.ToUndirectedGraph方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: ClusterTwoDataObjects
public void ClusterTwoDataObjects()
{
var nj = new NeighborJoiningClusterer<char>((o1, o2) => 1);
IUndirectedGraph<Cluster<char>, ClusterEdge<char>> tree = nj.GenerateClusters(new[] {'A', 'B'});
var edges = new[]
{
new ClusterEdge<char>(new Cluster<char>('A'), new Cluster<char>('B'), 1.0)
};
AssertTreeEqual(tree, edges.ToUndirectedGraph<Cluster<char>, ClusterEdge<char>>());
}示例2: Cluster
public void Cluster()
{
var matrix = new double[,]
{
{0, 1, 2, 3, 3},
{1, 0, 2, 3, 3},
{2, 2, 0, 3, 3},
{3, 3, 3, 0, 1},
{3, 3, 3, 1, 0}
};
var nj = new NeighborJoiningClusterer<char>((o1, o2) => matrix[o1 - 'A', o2 - 'A']);
IUndirectedGraph<Cluster<char>, ClusterEdge<char>> tree = nj.GenerateClusters(new[] {'A', 'B', 'C', 'D', 'E'});
var vertices = new Dictionary<string, Cluster<char>>
{
{"root", new Cluster<char> {Description = "root"}},
{"A", new Cluster<char>('A') {Description = "A"}},
{"B", new Cluster<char>('B') {Description = "B"}},
{"C", new Cluster<char>('C') {Description = "C"}},
{"D", new Cluster<char>('D') {Description = "D"}},
{"E", new Cluster<char>('E') {Description = "E"}},
{"DE", new Cluster<char> {Description = "DE"}},
{"AB", new Cluster<char> {Description = "AB"}}
};
var edges = new[]
{
new ClusterEdge<char>(vertices["root"], vertices["C"], 1.0),
new ClusterEdge<char>(vertices["root"], vertices["DE"], 1.5),
new ClusterEdge<char>(vertices["root"], vertices["AB"], 0.5),
new ClusterEdge<char>(vertices["DE"], vertices["D"], 0.5),
new ClusterEdge<char>(vertices["DE"], vertices["E"], 0.5),
new ClusterEdge<char>(vertices["AB"], vertices["A"], 0.5),
new ClusterEdge<char>(vertices["AB"], vertices["B"], 0.5)
};
AssertTreeEqual(tree, edges.ToUndirectedGraph<Cluster<char>, ClusterEdge<char>>(false));
}