- Timestamp:
- 08/20/08 11:06:11 (16 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/sources/HeuristicLab.StructureIdentification/Recombination/SizeFairCrossOver.cs
r450 r526 214 214 IFunctionTree parent = possibleParents.ElementAt(random.Next(possibleParents.Count())).GetTreeNode(); 215 215 216 int minArity; 217 int maxArity; 218 gardener.GetMinMaxArity(parent.Function, out minArity, out maxArity); 219 int nSlots = Math.Max(2, minArity); 216 int nSlots = Math.Max(2, parent.Function.MinArity); 220 217 // determine which slot can take which sub-trees 221 218 List<IFunctionTree>[] slots = new List<IFunctionTree>[nSlots];
Note: See TracChangeset
for help on using the changeset viewer.