giden.GRDS
Class Node

java.lang.Object
  |
  +--giden.GRDS.Index
        |
        +--giden.GRDS.Node
All Implemented Interfaces:
java.io.Serializable

public class Node
extends Index

Copyright (c) 1993-2004 C. R. Coullard, D. S. Dilworth, J. H. Owen, All Rights Reserved.
We make no representations or warranties about the suitability of the software, either express or implied, including but not limited to the implied warranties of merchantability, fitness for a particular purpose, or non-infringement. We shall not be liable for any damages suffered by user as a result of using, modifying or distributing this software or its derivatives.

Node is a class that is tightly coupled to the Graph class and provides methods for interacting with Node objects. A Node has a list of incident edges (called the "adjacency list") and a unique node Index. The incident edges can be further partitioned into incoming and outgoing edges. The Index is an integer that is assigned to the Node when it is created. Methods are provided to access the incident edges (all, incoming, or outgoing), through iterators, and the Index. Note the Index is accessed through the Index base class using the GetIndex method. Although Nodes (and Edges) are created from the Graph class, their Edges and Indexes are accessed through the Node methods.

Copyright (c) 1993-2003 C. R. Coullard, D. S. Dilworth, J. H. Owen, All Rights Reserved.

Version:
4.0a 2004 08 27
Author:
D. S. Dilworth
See Also:
Edge, EdgeListIter, Graph, InListIter, Index, Network, Node, NodeArray, OutListIter, Serialized Form

Method Summary
 LinkList GetAdjList()
          Internal method
 EdgeListIter GetAdjListIter()
          Gets the adjacency list iterator of this Node
 int GetEdgeCount()
          Gets the count of adjacent edges for this node.
 EdgeListIter GetInListIter()
          Gets the incoming edge list iterator of this Node
 EdgeListIter GetOutListIter()
          Gets the outgoing edge list of this Node
 boolean IsMember(Graph graph)
          Internal method
 
Methods inherited from class giden.GRDS.Index
GetIndex
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Method Detail

IsMember

public boolean IsMember(Graph graph)
Internal method

GetEdgeCount

public int GetEdgeCount()
Gets the count of adjacent edges for this node. The number of incoming and outgoing is not available without sequencing through incoming or outgoing edge list.

GetAdjListIter

public EdgeListIter GetAdjListIter()
Gets the adjacency list iterator of this Node
Returns:
An EdgeListIter of this nodes adjacent Edges

GetInListIter

public EdgeListIter GetInListIter()
Gets the incoming edge list iterator of this Node
Returns:
An incoming EdgeListIter of this nodes adjacent Edges

GetOutListIter

public EdgeListIter GetOutListIter()
Gets the outgoing edge list of this Node
Returns:
An outgoing EdgeListIter of this Nodes adjacent Edges

GetAdjList

public LinkList GetAdjList()
Internal method