Package | Description |
---|---|
nl.tue.alignment.algorithms | |
nl.tue.alignment.algorithms.datastructures | |
nl.tue.alignment.algorithms.implementations |
Modifier and Type | Method and Description |
---|---|
ReplayAlgorithm |
Queue.getAlgorithm()
Return the algorithm for which this Queue is used.
|
ReplayAlgorithm |
VisitedSet.getAlgorithm()
Return the algorithm for which this closedSet is used.
|
Modifier and Type | Method and Description |
---|---|
void |
ReplayAlgorithm.Debug.writeEdgeTraversed(ReplayAlgorithm algorithm,
int fromMarking,
int transition,
int toMarking) |
void |
ReplayAlgorithm.Debug.writeEdgeTraversed(ReplayAlgorithm algorithm,
int fromMarking,
int transition,
int toMarking,
java.lang.String extra)
Should be called when an edge is traversed in the search from marking with ID
fromMarking to marking with ID toMarking though firing transition.
|
void |
ReplayAlgorithm.Debug.writeMarkingReached(ReplayAlgorithm algorithm,
int marking) |
void |
ReplayAlgorithm.Debug.writeMarkingReached(ReplayAlgorithm algorithm,
int marking,
java.lang.String extra) |
Modifier and Type | Field and Description |
---|---|
protected ReplayAlgorithm |
HashBackedPriorityQueue.algorithm |
Modifier and Type | Method and Description |
---|---|
ReplayAlgorithm |
HashBackedPriorityQueue.getAlgorithm() |
ReplayAlgorithm |
VisitedHashSet.getAlgorithm() |
Constructor and Description |
---|
HashBackedPriorityQueue(ReplayAlgorithm algorithm,
int initialCapacity) |
HashBackedPriorityQueue(ReplayAlgorithm algorithm,
int initialCapacity,
int maxCost) |
SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm,
int initialCapacity,
boolean preferExact) |
SortedHashBackedPriorityQueue(ReplayAlgorithm algorithm,
int initialCapacity,
int maxCost,
boolean preferExact)
Creates a
HashBackedPriorityQueue with the specified initial capacity
that orders its elements according to the specified comparator. |
VisitedHashSet(ReplayAlgorithm algorithm,
int initialCapacity)
Initializes a closed set with the given initial capacity
|
Modifier and Type | Class and Description |
---|---|
class |
AStar
Implements a variant of AStar intest path algorithm for alignments.
|
static class |
AStar.Full
Special version of AStar that builds the entire search space, i.e.
|
class |
AStarLargeLP
Implements a variant of AStar intest path algorithm for alignments.
|
static class |
AStarLargeLP.Full
Special version of AStarLargeLP that builds the entire search space, i.e.
|
class |
Dijkstra
Implements a variant of Dijkstra's intest path algorithm for alignments, i.e.
|
static class |
Dijkstra.Full
Special version of Dijkstra that builds the entire search space, i.e.
|
class |
FullStatespaceBuilder
Implements a variant of Dijkstra's shortest path algorithm for alignments,
i.e.
|
Modifier and Type | Method and Description |
---|---|
protected void |
AStarLargeLP.writeEdgeTraversed(ReplayAlgorithm algorithm,
int fromMarking,
int transition,
int toMarking,
java.lang.String extra) |