A B C D E F G H I L M N O P R S T U V W X

H

hasAdditionalNodes() - Method in class uk.ed.inf.graph.compound.base.BaseSubCompoundGraphBuilder
 
hasDirectedEnds(IDirectedPair<? super BaseCompoundNode, ? super BaseCompoundEdge>) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundEdge
 
hasDirectedEnds(BaseCompoundNode, BaseCompoundNode) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundNodePair
 
hasDirectedEnds(IDirectedPair<? super N, ? super E>) - Method in interface uk.ed.inf.graph.directed.IDirectedEdge
Tests if this directed edge has these ends.
hasDirectedEnds(N, N) - Method in interface uk.ed.inf.graph.directed.IDirectedPair
Tests if the ends exist in this directed pair.
hasEdgesWith(N, N) - Method in interface uk.ed.inf.graph.util.IEdgeSet
Does this edge set contain one or more edges associated with this node?
hasEdgesWith(N, N) - Method in class uk.ed.inf.graph.util.impl.DirectedEdgeSet
 
hasEdgesWith(N, N) - Method in class uk.ed.inf.graph.util.impl.EdgeSet
 
hasEdgesWith(N, N) - Method in class uk.ed.inf.graph.util.impl.FilteredEdgeSet
 
hasEdgeWith(N) - Method in interface uk.ed.inf.graph.basic.IBasicNode
Tests whether this node shares one or more edges with another node, irrespective of the direction of that edge.
hasEdgeWith(BaseCompoundNode) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundNode
 
hasEdgeWith(Node) - Method in class uk.ed.inf.graph.impl.Node
 
hasEnds(IBasicPair<? super N, ? super E>) - Method in interface uk.ed.inf.graph.basic.IBasicEdge
Tests if this edge has these ends.
hasEnds(N, N) - Method in interface uk.ed.inf.graph.basic.IBasicPair
Tests if this end pair is made up of these two nodes.
hasEnds(IBasicPair<? super BaseCompoundNode, ? super BaseCompoundEdge>) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundEdge
 
hasEnds(BaseCompoundNode, BaseCompoundNode) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundNodePair
 
hasEnds(IBasicPair<? super Node, ? super Edge>) - Method in class uk.ed.inf.graph.impl.Edge
 
hasEnds(Node, Node) - Method in class uk.ed.inf.graph.impl.NodePair
 
hashCode() - Method in class uk.ed.inf.bitstring.BitString
 
hashCode() - Method in interface uk.ed.inf.bitstring.IBitString
 
hashCode() - Method in interface uk.ed.inf.graph.basic.IBasicNode
Get the hash code for this node.
hashCode() - Method in interface uk.ed.inf.graph.basic.IBasicPair
The hashCode that should given identical behaviour to equals.
hashCode() - Method in class uk.ed.inf.graph.impl.Edge
 
hashCode() - Method in class uk.ed.inf.graph.impl.Node
 
hashCode() - Method in class uk.ed.inf.graph.impl.NodePair
 
hashCode() - Method in class uk.ed.inf.graph.util.impl.FilteredEdgeSet
 
hashCode() - Method in class uk.ed.inf.graph.util.impl.FilteredNodeSet
 
hashCode() - Method in class uk.ed.inf.graph.util.impl.NodeSet
 
hasInEdgeFrom(BaseCompoundNode) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundNode
 
hasInEdgeFrom(N) - Method in interface uk.ed.inf.graph.directed.IDirectedNode
Has at least one edge coming into this one from outNode
hasNext() - Method in class uk.ed.inf.graph.util.impl.AppendingIterator
 
hasNext() - Method in class uk.ed.inf.graph.util.impl.ConnectedNodeIterator
 
hasNext() - Method in class uk.ed.inf.graph.util.impl.EdgeFromNodeIterator
 
hasNext() - Method in class uk.ed.inf.graph.util.impl.FilteredIterator
 
hasNext() - Method in class uk.ed.inf.graph.util.impl.NodeTreeIterator
 
hasNext() - Method in class uk.ed.inf.tree.AncestorTreeIterator
 
hasNext() - Method in class uk.ed.inf.tree.LevelOrderTreeIterator
 
hasOutEdgeTo(BaseCompoundNode) - Method in class uk.ed.inf.graph.compound.base.BaseCompoundNode
 
hasOutEdgeTo(N) - Method in interface uk.ed.inf.graph.directed.IDirectedNode
Has at least one edge going out from this node to inNode.
hasPassedAdditionalValidation() - Method in class uk.ed.inf.graph.compound.base.BaseChildCompoundGraph
A hook method that should be used to provide addition validation for the class inheriting from this one.
hasPassedAdditionalValidation() - Method in class uk.ed.inf.graph.compound.base.BaseCompoundGraph
A hook method that should be used to provide addition validation for the class inheriting from this one.
hasPassedAdditionalValidation() - Method in class uk.ed.inf.graph.compound.impl.ChildCompoundGraph
 
hasPassedAdditionalValidation() - Method in class uk.ed.inf.graph.compound.impl.CompoundGraph
 

A B C D E F G H I L M N O P R S T U V W X