1 public class GraphNode extends Node {
3 // protected List inNeighbors;
4 // protected List outNeighbors;
5 protected Vector inNeighbors;
6 protected Vector outNeighbors;
8 protected GraphNode() {
12 public GraphNode(Object n) {
15 inNeighbors = new Vector();
16 outNeighbors = new Vector();
19 // public Object getData() {
20 // return getNodeData(this);
23 // public Object setData(Object n) {
24 // return setNodeData(this, n);
27 public final boolean addInNeighbor(GraphNode n) {
28 if (inNeighbors.contains(n)) {
31 inNeighbors.addElement(n);
36 public final boolean removeInNeighbor(GraphNode n) {
37 return inNeighbors.remove(n);
40 public final boolean hasInNeighbor(GraphNode n) {
41 return inNeighbors.contains(n);
44 public final Vector getInNeighbors() {
48 public final Vector getInNeighborsCopy() {
49 return inNeighbors.clone();
52 public final boolean addOutNeighbor(GraphNode n) {
53 if (outNeighbors.contains(n)) {
56 outNeighbors.addElement(n);
61 public final boolean removeOutNeighbor(GraphNode n) {
62 return outNeighbors.remove(n);
64 public final boolean hasOutNeighbor(GraphNode n) {
65 return outNeighbors.contains(n);
68 public final Vector getOutNeighbors() {
72 public final Vector getOutNeighborsCopy() {
73 return outNeighbors.clone();