- Timestamp:
- 04/17/19 23:10:22 (6 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring/3.3/GraphColoringProblem.cs
r16767 r16808 34 34 35 35 namespace HeuristicLab.Problems.GraphColoring { 36 [StorableType("88078013-834F-40AC-9298-B8E1C4B393D3")] 36 37 public enum FitnessFunction { Prioritized, Penalized } 37 38 [Item("Graph Coloring Problem (GCP)", "Attempts to find a coloring using a minimal number of colors that doesn't produce a conflict.")] … … 172 173 var orderedIndividuals = lles.Zip(qualities, (i, q) => new { LLE = i, Quality = q }).OrderBy(z => z.Quality); 173 174 var best = Maximization ? orderedIndividuals.Last().LLE : orderedIndividuals.First().LLE; 174 175 175 176 var llee = best.ToEndLinks(); 176 177 var colors = llee.Distinct().Count(); 177 178 var conflicts = CalculateConflicts(llee); 178 179 179 180 IResult res; 180 181 int bestColors = int.MaxValue, bestConflicts = int.MaxValue;
Note: See TracChangeset
for help on using the changeset viewer.