points.jad

来自「聚类算法：最短距离算法。对给定的数据集进行自底向上的层次的分解」· JAD 代码 · 共 30 行

// Decompiled by DJ v3.7.7.81 Copyright 2004 Atanas Neshkov  Date: 2004-11-24 0:46:31
// Home Page : http://members.fortunecity.com/neshkov/dj.html  - Check often for new version!
// Decompiler options: packimports(3) 
// Source File Name:   mdistance.java


class Points
{

    Points()
    {
    }

    void append(Points points)
    {
        Points points1;
        for(points1 = this; points1.next != null; points1 = points1.next);
        points1.next = points;
    }

    void remove(Points points)
    {
        points.next = null;
    }

    int x;
    int y;
    int N;
    Points next;
}