本文整理汇总了C#中Problem.DetermineSuppressedGivens方法的典型用法代码示例。如果您正苦于以下问题：C# Problem.DetermineSuppressedGivens方法的具体用法？C# Problem.DetermineSuppressedGivens怎么用？C# Problem.DetermineSuppressedGivens使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Problem的用法示例。
在下文中一共展示了Problem.DetermineSuppressedGivens方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: GenerateMaximalProblemFromSingleEdge
//
// For all given nodes in this problem, generate the single maximal problem
//
// This is done is a convluted way to speed up execution since we need to combine in the size of the powerset of cardinality of givens
//
private void GenerateMaximalProblemFromSingleEdge(ProblemHashMap<Hypergraph.EdgeAnnotation> memoizedProblems,
HyperEdgeMultiMap<Hypergraph.EdgeAnnotation> edgeDatabase,
Problem<Hypergraph.EdgeAnnotation> baseProblem)
{
// Create all simple problems by pursuing only a single path backward in the givens: append
// all problems from a given to the base problem
//
// |
// v
// given __
// | |
// v | baseProblem
// goal __|
//
// Acquire all of the problems for the singleton sets of the powerset for all of the givens of this problem
List<Problem<Hypergraph.EdgeAnnotation>>[] singletonMapToNewProblems = new List<Problem<Hypergraph.EdgeAnnotation>>[baseProblem.givens.Count];
List<Problem<Hypergraph.EdgeAnnotation>>[] singletonMapToOriginalProblems = new List<Problem<Hypergraph.EdgeAnnotation>>[baseProblem.givens.Count];
bool generatedNewProblems = false;
for (int g = 0; g < baseProblem.givens.Count; g++)
{
// Acquire the original problems and save them
singletonMapToOriginalProblems[g] = GenerateAllMaximalProblemsFrom(memoizedProblems, edgeDatabase, baseProblem.givens[g]);
if (singletonMapToOriginalProblems[g] == null) singletonMapToOriginalProblems[g] = new List<Problem<Hypergraph.EdgeAnnotation>>();
// Using the original problems, append them to the base problem
singletonMapToNewProblems[g] = new List<Problem<Hypergraph.EdgeAnnotation>>();
// Append all of these given problems to the base problem
foreach (Problem<Hypergraph.EdgeAnnotation> problem in singletonMapToOriginalProblems[g])
{
Problem<Hypergraph.EdgeAnnotation> baseProblemCopy = new Problem<Hypergraph.EdgeAnnotation>(baseProblem);
baseProblemCopy.Append(graph, edgeDatabase, problem);
//memoizedProblems.Put(baseProblemCopy);
singletonMapToNewProblems[g].Add(baseProblemCopy);
generatedNewProblems = true;
}
}
if (baseProblem.goal == 98)
{
//Debug.WriteLine("98NO-OP");
}
// If we did not perform any appending, we have reached a maximal situation
// Add the maximal problem to the database
if (!generatedNewProblems)
{
// Determine suppression now to mitigate number of problems added
baseProblem.DetermineSuppressedGivens(graph);
memoizedProblems.Put(baseProblem);
return;
}
//
// Stitch together all of the possible combinations of maximal problems
//
// | | |
// | | |
// v v v
// g_1 g_2 ... g_n __
// | | baseProblem
// v |
// target __|
//
//
// We are looking for the maximal set of problems; therefore, we don't need all combinations.
// What we do require is the combining of all generated problems with the base problem.
//
// Find all the sets of populated new problems
List<int> populatedIndices = new List<int>();
for (int index = 0; index < singletonMapToNewProblems.Length; index++)
{
if (singletonMapToNewProblems[index].Any()) populatedIndices.Add(index);
}
List<Problem<Hypergraph.EdgeAnnotation>> maximalProblems = new List<Problem<Hypergraph.EdgeAnnotation>>(singletonMapToNewProblems[populatedIndices[0]]);
populatedIndices.RemoveAt(0);
foreach (int index in populatedIndices)
{
//int count = 0;
List<Problem<Hypergraph.EdgeAnnotation>> tmpMaximalProbs = new List<Problem<Hypergraph.EdgeAnnotation>>();
foreach (Problem<Hypergraph.EdgeAnnotation> singleton in singletonMapToOriginalProblems[index])
{
foreach (Problem<Hypergraph.EdgeAnnotation> problem in maximalProblems)
{
//if (baseProblem.goal == 98)
//{
// Debug.WriteLine(count++);
//}
Problem<Hypergraph.EdgeAnnotation> problemCopy = new Problem<Hypergraph.EdgeAnnotation>(problem);
// It is possible for a problem to have been created which deduced further information with an additional edge;
// that is, a given node was pushed into the path of the problem. Hence, no need to append in this situation
if (problem.givens.Contains(singleton.goal))
{
//.........这里部分代码省略.........