Uses of Class
ubic.basecode.dataStructure.graph.DirectedGraphNode
-
Packages that use DirectedGraphNode Package Description ubic.basecode.dataStructure.graph -
-
Uses of DirectedGraphNode in ubic.basecode.dataStructure.graph
Fields in ubic.basecode.dataStructure.graph with type parameters of type DirectedGraphNode Modifier and Type Field Description protected Map<K,DirectedGraphNode<K,V>>
DirectedGraph. items
Methods in ubic.basecode.dataStructure.graph that return DirectedGraphNode Modifier and Type Method Description DirectedGraphNode<K,V>
DirectedGraphNode. clone()
Makes a copy of this node.DirectedGraphNode<K,V>
DirectedGraph. getRoot()
Methods in ubic.basecode.dataStructure.graph that return types with arguments of type DirectedGraphNode Modifier and Type Method Description Set<DirectedGraphNode<K,V>>
DirectedGraphNode. getAllChildNodes()
Get all the children of this node, recursively.Set<DirectedGraphNode<K,V>>
DirectedGraphNode. getAllParentNodes()
Get all the parents of this node, recursively.Set<DirectedGraphNode<K,V>>
DirectedGraphNode. getChildNodes()
Get the immediate children of this node.Map<K,DirectedGraphNode<K,V>>
DirectedGraph. getItems()
Set<DirectedGraphNode<K,V>>
DirectedGraphNode. getParentNodes()
Get the immediate parents of this node.Methods in ubic.basecode.dataStructure.graph with parameters of type DirectedGraphNode Modifier and Type Method Description void
DirectedGraph. addNode(DirectedGraphNode<K,V> node)
int
DirectedGraphNode. compareTo(DirectedGraphNode<K,V> o)
Uses the topological sort order.
-