FilesExpand file tree

 master

/

Edge.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

62 lines (55 loc) · 1.06 KB

 master

/

Edge.java

Copy path

Top

File metadata and controls

• Code
• Blame

62 lines (55 loc) · 1.06 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

58

59

60

61

62

package DataMining_GSpan;

/**

* 边，用五元组表示

*

* @author lyq

*

*/

public class Edge {

// 五元组的大小比较结果

public static final int EDGE_EQUAL = 0;

public static final int EDGE_SMALLER = 1;

public static final int EDGE_LARGER = 2;

// 边的一端的id号标识

int ix;

// 边的另一端的id号标识

int iy;

// 边的一端的点标号

int x;

// 边的标号

int a;

// 边的另一端的点标号

int y;

public Edge(int ix, int iy, int x, int a, int y) {

this.ix = ix;

this.iy = iy;

this.x = x;

this.a = a;

this.y = y;

}

/**

* 当前边是与给定的边的大小比较关系

*

* @param e

* @return

*/

public int compareWith(Edge e) {

int result = EDGE_EQUAL;

int[] array1 = new int[] { ix, iy, x, y, a };

int[] array2 = new int[] { e.ix, e.iy, e.x, e.y, e.a };

// 按照ix, iy,x,y,a的次序依次比较

for (int i = 0; i < array1.length; i++) {

if (array1[i] < array2[i]) {

result = EDGE_SMALLER;

break;

} else if (array1[i] > array2[i]) {

result = EDGE_LARGER;

break;

} else {

// 如果相等，继续比较下一个

continue;

}

}

return result;

}

}