Class AbstractGraphNode<K,V>
java.lang.Object
ubic.basecode.dataStructure.Visitable
ubic.basecode.dataStructure.graph.AbstractGraphNode<K,V>
- All Implemented Interfaces:
GraphNode<K,
V>
- Direct Known Subclasses:
DirectedGraphNode
,UndirectedGraphNode
- Author:
- Paul Pavlidis
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionAbstractGraphNode
(K key) Create a new node when given only a key.AbstractGraphNode
(K key, V value) -
Method Summary
-
Field Details
-
item
-
key
-
visited
protected boolean visited
-
-
Constructor Details
-
AbstractGraphNode
Create a new node when given only a key.- Parameters:
key
-
-
AbstractGraphNode
-
-
Method Details
-
getItem
Get the actual contents of the node. -
getKey
Get the key for the node. -
isVisited
public boolean isVisited() -
mark
public void mark() -
setItem
Description copied from interface:GraphNode
Set the contents of the node. -
setValue
Description copied from interface:GraphNode
Set the key and value associated with this node. -
toString
-
unMark
public void unMark()
-