2362N/A * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 0N/A * under the terms of the GNU General Public License version 2 only, as 2362N/A * published by the Free Software Foundation. Oracle designates this 0N/A * particular file as subject to the "Classpath" exception as provided 2362N/A * by Oracle in the LICENSE file that accompanied this code. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 2362N/A * or visit www.oracle.com if you need additional information or have any 0N/A * A node in a directed graph. In addition to an arbitrary 0N/A * <code>Object</code> containing user data associated with the node, 0N/A * each node maintains a <code>Set</code>s of nodes which are pointed 0N/A * to by the current node (available from <code>getOutNodes</code>). 0N/A * The in-degree of the node (that is, number of nodes that point to 0N/A * the current node) may be queried. 0N/A /** The data associated with this node. */ 0N/A * A <code>Set</code> of neighboring nodes pointed to by this 0N/A /** The in-degree of the node. */ 0N/A * A <code>Set</code> of neighboring nodes that point to this 0N/A /** Returns the <code>Object</code> referenced by this node. */ 0N/A * Returns an <code>Iterator</code> containing the nodes pointed * Adds a directed edge to the graph. The outNodes list of this * node is updated and the in-degree of the other node is incremented. * @param node a <code>DigraphNode</code>. * @return <code>true</code> if the node was not previously the * Returns <code>true</code> if an edge exists between this node * @param node a <code>DigraphNode</code>. * @return <code>true</code> if the node is the target of an edge. * Removes a directed edge from the graph. The outNodes list of this * node is updated and the in-degree of the other node is decremented. * @return <code>true</code> if the node was previously the target * Removes this node from the graph, updating neighboring nodes /** Returns the in-degree of this node. */ /** Increments the in-degree of this node. */ /** Decrements the in-degree of this node. */