uk.ed.inf.graph.directed
Interface IDirectedEdge<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>

All Superinterfaces:
java.lang.Comparable<E>, IBasicEdge<N,E>
All Known Subinterfaces:
ICompoundEdge<N,E>
All Known Implementing Classes:
ArchetypalCompoundEdge, BaseCompoundEdge, CompoundEdge

public interface IDirectedEdge<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>
extends IBasicEdge<N,E>


Method Summary
 IDirectedPair<N,E> getConnectedNodes()
          Get the ends of
 boolean hasDirectedEnds(IDirectedPair<? super N,? super E> ends)
          Tests if this directed edge has these ends.
 
Methods inherited from interface uk.ed.inf.graph.basic.IBasicEdge
getGraph, getIndex, hasEnds, isRemoved, isSelfEdge
 
Methods inherited from interface java.lang.Comparable
compareTo
 

Method Detail

getConnectedNodes

IDirectedPair<N,E> getConnectedNodes()
Description copied from interface: IBasicEdge
Get the ends of

Specified by:
getConnectedNodes in interface IBasicEdge<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>>
Returns:

hasDirectedEnds

boolean hasDirectedEnds(IDirectedPair<? super N,? super E> ends)
Tests if this directed edge has these ends. Ignores the directions of the ends.

Parameters:
ends - The ends to be tested.
Returns:
true if the edge contains the ends, false otherwise.