Class UndirectedGraphNode<K,V>
- java.lang.Object
-
- ubic.basecode.dataStructure.Visitable
-
- ubic.basecode.dataStructure.graph.AbstractGraphNode<K,V>
-
- ubic.basecode.dataStructure.graph.UndirectedGraphNode<K,V>
-
- All Implemented Interfaces:
Comparable<UndirectedGraphNode<K,V>>
,GraphNode<K,V>
public class UndirectedGraphNode<K,V> extends AbstractGraphNode<K,V> implements Comparable<UndirectedGraphNode<K,V>>
- Author:
- Paul Pavlidis
-
-
Field Summary
-
Fields inherited from class ubic.basecode.dataStructure.graph.AbstractGraphNode
item, key, visited
-
-
Constructor Summary
Constructors Constructor Description UndirectedGraphNode(K key)
UndirectedGraphNode(K key, V value, Graph<UndirectedGraphNode<K,V>,K,V> graph)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int
compareTo(UndirectedGraphNode<K,V> o)
Graph<UndirectedGraphNode<K,V>,K,V>
getGraph()
int
numNeighbors()
-
-
-
Method Detail
-
compareTo
public int compareTo(UndirectedGraphNode<K,V> o)
- Specified by:
compareTo
in interfaceComparable<K>
-
numNeighbors
public int numNeighbors()
-
-