org.apache.cayenne.ashwood.graph
Interface Digraph<E,V>
- All Superinterfaces:
- DigraphIteration<E,V>
- All Known Implementing Classes:
- MapDigraph
public interface Digraph<E,V>
- extends DigraphIteration<E,V>
- Since:
- 3.1
addVertex
boolean addVertex(E vertex)
addAllVertices
boolean addAllVertices(java.util.Collection<? extends E> vertices)
putArc
V putArc(E origin,
E destination,
V arc)
getArc
V getArc(E origin,
E destination)
removeVertex
boolean removeVertex(E vertex)
removeAllVertices
boolean removeAllVertices(java.util.Collection<? extends E> vertices)
removeArc
java.lang.Object removeArc(E origin,
E destination)
removeIncoming
boolean removeIncoming(E vertex)
removeOutgoing
boolean removeOutgoing(E vertex)
order
int order()
size
int size()
outgoingSize
int outgoingSize(E vertex)
incomingSize
int incomingSize(E vertex)
containsVertex
boolean containsVertex(E vertex)
containsAllVertices
boolean containsAllVertices(java.util.Collection<? extends E> vertices)
hasArc
boolean hasArc(E origin,
E destination)
isEmpty
boolean isEmpty()
isOutgoingEmpty
boolean isOutgoingEmpty(E vertex)
isIncomingEmpty
boolean isIncomingEmpty(E vertex)
Copyright © 2001-2012 Apache Cayenne. All Rights Reserved.