dbscan-java.rar_DBSCAN_DBScan java

1: package com.sunzhenxing;

2:

3: public class Point {

4: private int x;

5: private int y;

6: private boolean isKey;

7: private boolean isClassed;

8:

9: public boolean isKey() {

16: public boolean isClassed() {

17: return isClassed;

18: }

19: public void setClassed(boolean isClassed) {

20: this.isClassed = isClassed;

21: }

22: public int getX() {

23: return x;

24: }

25: public void setX(int x) {

32: this.y = y;

33: }

34:

35: public Point(){

36: x=0;

37: y=0;

38: }

39: public Point(int x,int y){

40: this.x=x;

41: this.y=y;

48: public String print(){

49: return "<"+this.x+","+this.y+">";

50: }

51: }

52:

然后定义一个工具类，为算法的实现服务：

1: package com.sunzhenxing;

2:

3: import java.io.BufferedReader;

4: import java.io.FileReader;

11: int dx=p.getX()-q.getX();

12: int dy=p.getY()-q.getY();

13: double distance=Math.sqrt(dx*dx+dy*dy);

14: return distance;

15: }

16: //检测 p 点是不是核心点，tmpLst 存储核心点的直达点

17: public static List<Point> isKeyPoint(List<Point> lst,Point p,int

e,int minp){

18: int count=0;

19: List<Point> tmpLst=new ArrayList<Point>();

26: }

27: }

28: }

29: if(count>=minp){

30: p.setKey(true);

31: return tmpLst;

32: }

33: return null;

34: }

35: //合并两个链表，前提是 b 中的核心点包含在 a 中

42: Point p=b.get(index);

43: if(p.isKey() && a.contains(p)){

44: merge=true;

45: break;

46: }

47: }

48: if(merge){

49: for(int index=0;index<b.size();++index){