本文整理汇总了C#中ISymbolicExpressionTreeNode.GetDepth方法的典型用法代码示例。如果您正苦于以下问题：C# ISymbolicExpressionTreeNode.GetDepth方法的具体用法？C# ISymbolicExpressionTreeNode.GetDepth怎么用？C# ISymbolicExpressionTreeNode.GetDepth使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ISymbolicExpressionTreeNode的用法示例。
在下文中一共展示了ISymbolicExpressionTreeNode.GetDepth方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: PTC2
public static void PTC2(IRandom random, ISymbolicExpressionTreeNode seedNode,
int maxLength, int maxDepth) {
// make sure it is possible to create a trees smaller than maxLength and maxDepth
if (seedNode.Grammar.GetMinimumExpressionLength(seedNode.Symbol) > maxLength)
throw new ArgumentException("Cannot create trees of length " + maxLength + " or shorter because of grammar constraints.", "maxLength");
if (seedNode.Grammar.GetMinimumExpressionDepth(seedNode.Symbol) > maxDepth)
throw new ArgumentException("Cannot create trees of depth " + maxDepth + " or smaller because of grammar constraints.", "maxDepth");
// tree length is limited by the grammar and by the explicit size constraints
int allowedMinLength = seedNode.Grammar.GetMinimumExpressionLength(seedNode.Symbol);
int allowedMaxLength = Math.Min(maxLength, seedNode.Grammar.GetMaximumExpressionLength(seedNode.Symbol, maxDepth));
int tries = 0;
while (tries++ < MAX_TRIES) {
// select a target tree length uniformly in the possible range (as determined by explicit limits and limits of the grammar)
int targetTreeLength;
targetTreeLength = random.Next(allowedMinLength, allowedMaxLength + 1);
if (targetTreeLength <= 1 || maxDepth <= 1) return;
bool success = TryCreateFullTreeFromSeed(random, seedNode, targetTreeLength - 1, maxDepth - 1);
// if successful => check constraints and return the tree if everything looks ok
if (success && seedNode.GetLength() <= maxLength && seedNode.GetDepth() <= maxDepth) {
return;
} else {
// clean seedNode
while (seedNode.Subtrees.Any()) seedNode.RemoveSubtree(0);
}
// try a different length MAX_TRIES times
}
throw new ArgumentException("Couldn't create a random valid tree.");
}