graphnode.java

一个数据挖掘软件ALPHAMINERR的整个过程的JAVA版源代码

/*
 *    This program is free software; you can redistribute it and/or modify
 *    it under the terms of the GNU General Public License as published by
 *    the Free Software Foundation; either version 2 of the License, or
 *    (at your option) any later version.
 *
 *    This program is distributed in the hope that it will be useful,
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *    GNU General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with this program; if not, write to the Free Software
 *    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

/*
 *    GraphNode.java
 *    Copyright (C) 2003 Ashraf M. Kibriya
 *
 */

package weka.gui.graphvisualizer;

/**
 * This class represents a node in the Graph.
 *
 * @author Ashraf M. Kibriya ([e-mail])
 * @version 1.0 - 23 Apr 2003 - Initial version (Ashraf M. Kibriya)
 */

public class GraphNode extends Object implements GraphConstants {
    /** ID and label for the node */
    String ID, lbl;
    /** The outcomes for the given node */
    String [] outcomes;
    /** probability table for each outcome given outcomes of parents, if any */
    double [][] probs;   //probabilities
    /** The x and y position of the node */
    int x=0, y=0; 
    /** The indices of parent nodes */
    int [] prnts;       //parent nodes
    /** The indices of nodes to which there are edges from this 
        node, plus the type of edge */
    int [][] edges;
    /**  Type of node. Default is Normal node type */
    int nodeType=NORMAL;
    
    /**
     *  Constructor
     *
     */
    public GraphNode(String id, String label) {
	ID = id; lbl = label; nodeType=NORMAL;
    }
    
    /**
     *  Constructor
     *
     */
    public GraphNode(String id, String label, int type ) {
	ID = id; lbl = label; nodeType = type;
    }
    
    /**
     *  Returns true if passed in argument is an instance
     *  of GraphNode and is equal to this node.
     *  Implemented to enable the use of contains method
     *  in Vector/FastVector class.
     */
    public boolean equals(Object n) {
	if(n instanceof GraphNode && ((GraphNode) n).ID.equalsIgnoreCase(this.ID))
	    { //System.out.println("returning true, n.ID >"+((GraphNode)n).ID+"< this.ID >"+this.ID+"<"); 
		return true; }
	else
	    return false;
    }
} // GraphNode