public DemoTraversable(int heapScore, DemoTraversable from, bool isLeaf)
{
IsLeaf = isLeaf;
HeapScore = heapScore;
this.from = from;
to = null;
}
private static ITraversable StarterTree(bool isLeaf)
{
DemoTraversable rootNode = new DemoTraversable(heapScore: 5);
rootNode.to = new ITraversable[]
{
new DemoTraversable(3, rootNode, isLeaf),
new DemoTraversable(5, rootNode, isLeaf),
new DemoTraversable(1, rootNode, isLeaf),
new DemoTraversable(2, rootNode, isLeaf),
new DemoTraversable(-1, rootNode, isLeaf),
new DemoTraversable(7, rootNode, isLeaf)
};
return(rootNode);
}
private static ITraversable ThreeDeepTree()
{
DemoTraversable rootNode = (DemoTraversable)StarterTree(false);
ITraversable[] nodes = rootNode.to;
for (int i = 0; i < nodes.Length; i++)
{
DemoTraversable node = (DemoTraversable)nodes[i];
node.to = new ITraversable[]
{
new DemoTraversable((int)(Random.value * 100), rootNode, true),
new DemoTraversable((int)(Random.value * 100), rootNode, true),
new DemoTraversable((int)(Random.value * 100), rootNode, true),
new DemoTraversable((int)(Random.value * 100), rootNode, true),
new DemoTraversable((int)(Random.value * 100), rootNode, true)
};
}
return(rootNode);
}
