| Package | Description |
|---|---|
| analysis | |
| nfa |
| Modifier and Type | Method and Description |
|---|---|
NFAEdge |
NFAAnalyserInterface.EdaAnalysisResultsESCC.getEntranceEdge() |
NFAEdge |
NFAAnalyserInterface.EdaAnalysisResultsESCC.getExitEdge() |
NFAEdge |
NFAAnalyserInterface.EdaAnalysisResultsParallel.getParallelEdge() |
| Modifier and Type | Method and Description |
|---|---|
LinkedList<NFAEdge> |
NFAAnalyserInterface.IdaAnalysisResultsIda.getMaxPath() |
static LinkedList<NFAEdge> |
NFAAnalysisTools.shortestPathBetween(NFAGraph m,
NFAVertexND start,
NFAVertexND finish) |
static LinkedList<NFAEdge> |
NFAAnalysisTools.shortestPathTo(NFAGraph m,
NFAVertexND finish)
This function finds the shortest path from the initial state in the NFA
to a certain finish state.
|
| Modifier and Type | Method and Description |
|---|---|
static String |
ExploitStringBuilder.buildStringFromEdges(LinkedList<NFAEdge> edges)
This function loops through a list of edges and build a string of all
edges representing a symbol transition.
|
static NFAGraph |
NFAAnalysisTools.productConstruction(NFAGraph m1,
NFAGraph m2,
HashMap<NFAEdge,TransitionLabel> originalWords) |
| Modifier and Type | Class and Description |
|---|---|
class |
FilterEdge
An NFA edge specifically used in the Mohri Filter.
|
| Modifier and Type | Method and Description |
|---|---|
NFAEdge |
NFAEdge.copy() |
NFAEdge |
FilterEdge.copy() |
NFAEdge |
NFAGraph.getEdge(NFAEdge e) |
| Modifier and Type | Method and Description |
|---|---|
Set<NFAEdge> |
NFAGraph.outgoingEpsilonEdgesOf(NFAVertexND v)
All the edges representing an epsilon transition from a vertex
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
NFAGraph.addEdge(NFAEdge newEdge)
Adds a new edge to the NFA graph
|
int |
NFAEdge.compareTo(NFAEdge o) |
NFAEdge |
NFAGraph.getEdge(NFAEdge e) |
Copyright © 2021. All rights reserved.