public abstract class AbstractOrderingRelationsGraph<BPN extends IBPNode<N>,C extends ICondition<BPN,C,E,F,N,P,T,M>,E extends IEvent<BPN,C,E,F,N,P,T,M>,F extends IFlow<N>,N extends INode,P extends IPlace,T extends ITransition,M extends IMarking<F,N,P,T>> extends AbstractDirectedGraph<IDirectedEdge<E>,E> implements IOrderingRelationsDescriptor<E,N>, IOrderingRelationsGraph<BPN,C,E,F,N,P,T,M>
edges, vertices| Modifier | Constructor and Description |
|---|---|
protected |
AbstractOrderingRelationsGraph() |
|
AbstractOrderingRelationsGraph(IBranchingProcess<BPN,C,E,F,N,P,T,M> bp) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
areCausal(E n1,
E n2)
Check if two nodes of this branching process are in the causal relation.
|
boolean |
areConcurrent(E n1,
E n2)
Check if two nodes of this branching process are concurrent.
|
boolean |
areInConflict(E n1,
E n2)
Check if two nodes of this branching process are in conflict.
|
boolean |
areInverseCausal(E n1,
E n2)
Check if two nodes of this branching process are in the inverse causal relation.
|
Set<E> |
getEvents() |
OrderingRelationType |
getOrderingRelation(E n1,
E n2)
Get ordering relation between two nodes of this branching process.
|
addEdge, isMultiGraphaddEdge, areAdjacent, getDirectedEdge, getEdge, getEdges, getEdgesWithSources, getEdgesWithSourcesAndTargets, getEdgesWithTargets, removeVertex, removeVertices, toDOTaddEdge, addEdge, checkEdge, getDirectPredecessors, getDirectPredecessors, getDirectSuccessors, getDirectSuccessors, getEdgesWithSource, getEdgesWithSourceAndTarget, getEdgesWithTarget, getFirstDirectPredecessor, getFirstDirectSuccessor, getFirstIncomingEdge, getFirstOutgoingEdge, getIncomingEdges, getOutgoingEdgesaddVertex, addVertices, areAdjacent, checkEdge, contains, contains, contains, countEdges, countVertices, getAdjacent, getConnectedVertices, getDisconnectedVertices, getEdges, getEdges, getEdges, getEntities, getFreshVertex, getVertices, removeEdge, removeEdges, toStringaddIndex, addIndex, clearMembers, removeIndex, removeIndexclone, compareTo, equals, getDescription, getId, getLabel, getName, getTag, hashCode, setDescription, setId, setName, setTagfinalize, getClass, notify, notifyAll, wait, wait, waitgetDirectPredecessors, getDirectPredecessors, getDirectSuccessors, getDirectSuccessors, getEdgesWithSource, getEdgesWithSourceAndTarget, getEdgesWithTarget, getFirstDirectPredecessor, getFirstDirectSuccessor, getFirstIncomingEdge, getFirstOutgoingEdge, getIncomingEdges, getOutgoingEdgesaddEdge, addEdge, addVertex, addVertices, areAdjacent, contains, contains, countEdges, countVertices, getAdjacent, getConnectedVertices, getDisconnectedVertices, getEdges, getEdges, getEdges, getFreshVertex, getVertices, removeEdge, removeEdgesgetDescription, getId, getName, getTag, setDescription, setId, setName, setTagcompareTogetEntitiespublic OrderingRelationType getOrderingRelation(E n1, E n2)
IOrderingRelationsDescriptorgetOrderingRelation in interface IOrderingRelationsDescriptor<E extends IEvent<BPN,C,E,F,N,P,T,M>,N extends INode>n1 - Node of this branching process.n2 - Node of this branching process.OrderingRelationType.public boolean areCausal(E n1, E n2)
IOrderingRelationsDescriptorpublic boolean areInverseCausal(E n1, E n2)
IOrderingRelationsDescriptorpublic boolean areConcurrent(E n1, E n2)
IOrderingRelationsDescriptorpublic boolean areInConflict(E n1, E n2)
IOrderingRelationsDescriptorCopyright © 2017. All rights reserved.