1 /*
2 * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 */
25
26 package javax.imageio.spi;
27
28 import java.io.Serializable;
29 import java.util.HashSet;
30 import java.util.Iterator;
31 import java.util.Set;
32
33 /**
34 * A node in a directed graph. In addition to an arbitrary
35 * <code>Object</code> containing user data associated with the node,
36 * each node maintains a <code>Set</code>s of nodes which are pointed
37 * to by the current node (available from <code>getOutNodes</code>).
38 * The in-degree of the node (that is, number of nodes that point to
39 * the current node) may be queried.
40 *
41 */
42 class DigraphNode implements Cloneable, Serializable {
43
44 /** The data associated with this node. */
45 protected Object data;
46
47 /**
48 * A <code>Set</code> of neighboring nodes pointed to by this
49 * node.
50 */
51 protected Set outNodes = new HashSet();
52
53 /** The in-degree of the node. */
54 protected int inDegree = 0;
55
56 /**
57 * A <code>Set</code> of neighboring nodes that point to this
58 * node.
59 */
60 private Set inNodes = new HashSet();
61
62 public DigraphNode(Object data) {
|
1 /*
2 * Copyright (c) 2000, 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 */
25
26 package javax.imageio.spi;
27
28 import java.io.Serializable;
29 import java.util.HashSet;
30 import java.util.Iterator;
31 import java.util.Set;
32
33 /**
34 * A node in a directed graph. In addition to an arbitrary
35 * <code>Object</code> containing user data associated with the node,
36 * each node maintains a <code>Set</code>s of nodes which are pointed
37 * to by the current node (available from <code>getOutNodes</code>).
38 * The in-degree of the node (that is, number of nodes that point to
39 * the current node) may be queried.
40 *
41 */
42 class DigraphNode implements Cloneable, Serializable {
43 private static final long serialVersionUID = 5308261378582246841L;
44
45 /** The data associated with this node. */
46 protected Object data;
47
48 /**
49 * A <code>Set</code> of neighboring nodes pointed to by this
50 * node.
51 */
52 protected Set outNodes = new HashSet();
53
54 /** The in-degree of the node. */
55 protected int inDegree = 0;
56
57 /**
58 * A <code>Set</code> of neighboring nodes that point to this
59 * node.
60 */
61 private Set inNodes = new HashSet();
62
63 public DigraphNode(Object data) {
|