-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cs
57 lines (52 loc) · 1.36 KB
/
Solution.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace BNIPEA
{
class Solution
{
public double ob1;
public double ob2;
public double z1;
public double z2;
public double sum;
/// <summary>构造函数,无参
///
/// </summary>
public Solution()
{ }
/// <summary>构造函数,ob1,ob2
///
/// </summary>
/// <param name="ob1"></param>
/// <param name="ob2"></param>
public Solution(double ob1, double ob2)
{
this.ob1 = ob1;
this.ob2 = ob2;
this.z1 = ob1 + 0.000000001 * ob2;
this.z2 = ob2 + 0.000000001 * ob1;
this.sum = ob1 + ob2;
}
/// <summary>判断a是否支配b
///
/// </summary>
/// <param name="b"></param>
/// <returns></returns>
public bool dominate(Solution b)
{
return (this.ob1 <= b.ob1 && this.ob2 <= b.ob2 && this.sum < b.sum);
}
/// <summary>判断a与b是否相等
///
/// </summary>
/// <param name="b"></param>
/// <returns></returns>
public bool equal(Solution b)
{
return (this.ob1 == b.ob1 && this.ob2 == b.ob2);
}
}
}