public class NFAEdge extends org.jgrapht.graph.DefaultEdge implements Comparable<NFAEdge>
| Constructor and Description |
|---|
NFAEdge(NFAVertexND sourceVertex,
NFAVertexND targetVertex,
String transitionLabelString) |
NFAEdge(NFAVertexND sourceVertex,
NFAVertexND targetVertex,
TransitionLabel transitionLabel) |
| Modifier and Type | Method and Description |
|---|---|
int |
compareTo(NFAEdge o) |
NFAEdge |
copy() |
boolean |
equals(Object o) |
String |
getATransitionCharacter() |
boolean |
getIsEpsilonTransition() |
int |
getNumParallel() |
NFAVertexND |
getSourceVertex() |
NFAVertexND |
getTargetVertex() |
TransitionLabel |
getTransitionLabel() |
TransitionLabel.TransitionType |
getTransitionType() |
int |
hashCode() |
void |
incNumParallel() |
boolean |
isTransitionFor(String word) |
boolean |
isTransitionFor(TransitionLabel tl) |
void |
setNumParallel(int numParallel) |
void |
setTransitionLabel(String transitionLabelString) |
void |
setTransitionLabel(TransitionLabel transitionLabel) |
String |
toString() |
public NFAEdge(NFAVertexND sourceVertex, NFAVertexND targetVertex, String transitionLabelString) throws EmptyTransitionLabelException
EmptyTransitionLabelExceptionpublic NFAEdge(NFAVertexND sourceVertex, NFAVertexND targetVertex, TransitionLabel transitionLabel)
public NFAVertexND getSourceVertex()
public NFAVertexND getTargetVertex()
public int getNumParallel()
public void setNumParallel(int numParallel)
public void incNumParallel()
public TransitionLabel getTransitionLabel()
public String getATransitionCharacter()
public void setTransitionLabel(String transitionLabelString)
public void setTransitionLabel(TransitionLabel transitionLabel)
public boolean getIsEpsilonTransition()
public TransitionLabel.TransitionType getTransitionType()
public NFAEdge copy()
public String toString()
toString in class org.jgrapht.graph.DefaultEdgepublic boolean isTransitionFor(String word)
public boolean isTransitionFor(TransitionLabel tl)
public int compareTo(NFAEdge o)
compareTo in interface Comparable<NFAEdge>Copyright © 2021. All rights reserved.