equal
deleted
inserted
replaced
41 */ |
41 */ |
42 class DigraphNode<E> implements Cloneable, Serializable { |
42 class DigraphNode<E> implements Cloneable, Serializable { |
43 private static final long serialVersionUID = 5308261378582246841L; |
43 private static final long serialVersionUID = 5308261378582246841L; |
44 |
44 |
45 /** The data associated with this node. */ |
45 /** The data associated with this node. */ |
|
46 @SuppressWarnings("serial") // Not statically typed as Serializable |
46 protected E data; |
47 protected E data; |
47 |
48 |
48 /** |
49 /** |
49 * A {@code Set} of neighboring nodes pointed to by this |
50 * A {@code Set} of neighboring nodes pointed to by this |
50 * node. |
51 * node. |
51 */ |
52 */ |
|
53 @SuppressWarnings("serial") // Not statically typed as Serializable |
52 protected Set<DigraphNode<E>> outNodes = new HashSet<>(); |
54 protected Set<DigraphNode<E>> outNodes = new HashSet<>(); |
53 |
55 |
54 /** The in-degree of the node. */ |
56 /** The in-degree of the node. */ |
55 protected int inDegree = 0; |
57 protected int inDegree = 0; |
56 |
58 |
57 /** |
59 /** |
58 * A {@code Set} of neighboring nodes that point to this |
60 * A {@code Set} of neighboring nodes that point to this |
59 * node. |
61 * node. |
60 */ |
62 */ |
|
63 @SuppressWarnings("serial") // Not statically typed as Serializable |
61 private Set<DigraphNode<E>> inNodes = new HashSet<>(); |
64 private Set<DigraphNode<E>> inNodes = new HashSet<>(); |
62 |
65 |
63 public DigraphNode(E data) { |
66 public DigraphNode(E data) { |
64 this.data = data; |
67 this.data = data; |
65 } |
68 } |