AStarSetupTotalOrdervsPartialOrder (EarthMoversStochasticConformanceChecking)

java.lang.Object
- org.processmining.earthmoversstochasticconformancechecking.stochasticlanguage.partialorder.AStarSetupTotalOrdervsPartialOrder

public class AStarSetupTotalOrdervsPartialOrder
extends java.lang.Object

Field Summary

Fields
Modifier and Type Field Description

int numberOfActivities

int[] partialOrderB

int[] totalOrderA

Constructor Summary

Constructors
Constructor Description

AStarSetupTotalOrdervsPartialOrder()

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`int`	`computeHeuristic(TotalOrderPartialOrderState state, int numberOfActivities)`
`int`	`computeHeuristic1(TotalOrderPartialOrderState state, int numberOfActivities)`
`int`	`computeHeuristic2(TotalOrderPartialOrderState state, int numberOfActivities)`	Heuristic for best-case future LVS given the state.
`boolean`	`isFinal(TotalOrderPartialOrderState state)`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Field Detail
  - totalOrderA
```
public int[] totalOrderA
```
  - partialOrderB
```
public int[] partialOrderB
```
  - numberOfActivities
```
public int numberOfActivities
```
- Constructor Detail
  - AStarSetupTotalOrdervsPartialOrder
```
public AStarSetupTotalOrdervsPartialOrder()
```
- Method Detail
  - isFinal
```
public boolean isFinal(TotalOrderPartialOrderState state)
```
  - computeHeuristic
```
public int computeHeuristic(TotalOrderPartialOrderState state,
                            int numberOfActivities)
```
  - computeHeuristic1
```
public int computeHeuristic1(TotalOrderPartialOrderState state,
                             int numberOfActivities)
```
  - computeHeuristic2
```
public int computeHeuristic2(TotalOrderPartialOrderState state,
                             int numberOfActivities)
```
    Heuristic for best-case future LVS given the state. Idea: - All events with equal label can be matched - We will obtain Max(remaining events in total order, remaining events in partial order) edit operations of cost 1 (Rename as long as there are unmatchable activities in the shorter on, and delete/insert the rest)
    
    Parameters:
    
    state - Current A* state
    
    numberOfActivities - Total number of activities
    
    Returns: