uk.ed.inf.graph.directed
Interface IDirectedGraph<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>
- All Superinterfaces:
- IBasicGraph<N,E>
- All Known Subinterfaces:
- IChildCompoundGraph<N,E>, ICompoundGraph<N,E>, IDirectedSubgraph<N,E>, ISubCompoundGraph<N,E>
- All Known Implementing Classes:
- ArchetypalChildCompoundGraph, ArchetypalCompoundGraph, BaseChildCompoundGraph, BaseCompoundGraph, BaseSubCompoundGraph, ChildCompoundGraph, CompoundGraph, SubCompoundGraph
public interface IDirectedGraph<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>
- extends IBasicGraph<N,E>
Method Summary |
boolean |
containsDirectedEdge(IDirectedPair<? extends N,? extends E> ends)
Test if there is one or more directed edge defined by the end pair ends . |
boolean |
containsDirectedEdge(N outNode,
N inNode)
Tests if there is one or more directed edges from the outNode to the inNode . |
Methods inherited from interface uk.ed.inf.graph.basic.IBasicGraph |
containsConnection, containsConnection, containsEdge, containsEdge, containsNode, containsNode, edgeIterator, getEdge, getNode, getNumEdges, getNumNodes, nodeIterator |
containsDirectedEdge
boolean containsDirectedEdge(N outNode,
N inNode)
- Tests if there is one or more directed edges from the
outNode
to the inNode
.
- Parameters:
outNode
- the node the edge comes out from, can be null.inNode
- the node the edge goes into, can be null.
- Returns:
- true if there is such and edge, false otherwise.
containsDirectedEdge
boolean containsDirectedEdge(IDirectedPair<? extends N,? extends E> ends)
- Test if there is one or more directed edge defined by the end pair
ends
.
- Parameters:
ends
- the pair of nodes to be tested, can be null.
- Returns:
- true if there is at least one edge between then, false otherwise.