SearchState
UllmanSearchState
, VF2SearchState
, VFSearchState
public abstract class AbstractSearchState extends java.lang.Object implements SearchState
Modifier and Type | Field | Description |
---|---|---|
protected byte[] |
core_1 |
|
protected byte[] |
core_2 |
|
protected byte |
core_len |
|
protected byte |
n1 |
|
protected byte |
n2 |
NULL_NODE, ULLMAN_ALGORITHM, VF_ALGORITHM, VF2_ALGORITHM
Modifier | Constructor | Description |
---|---|---|
protected |
AbstractSearchState() |
|
|
AbstractSearchState(Graph g1,
Graph g2) |
Modifier and Type | Method | Description |
---|---|---|
void |
backTrack() |
|
byte |
getCoreLen() |
|
NodePair[] |
getCoreSet() |
|
java.util.List<Edge> |
getE1() |
|
Edge |
getE1(byte fromNodeID,
byte toNodeID) |
|
java.util.List<Edge> |
getE2() |
|
Edge |
getE2(byte fromNodeID,
byte toNodeID) |
|
Graph |
getG1() |
|
Graph |
getG2() |
|
java.util.List<Node> |
getN1() |
|
Node |
getN1(byte nodeID) |
|
java.util.List<Node> |
getN2() |
|
Node |
getN2(byte nodeID) |
|
protected void |
setG1(Graph g1) |
|
protected void |
setG2(Graph g2) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
addPair, copy, copy, isDead, isFeasiblePair, isGoal, nextPair
protected byte core_len
protected byte n1
protected byte n2
protected byte[] core_1
protected byte[] core_2
public void backTrack()
backTrack
in interface SearchState
public byte getCoreLen()
getCoreLen
in interface SearchState
public NodePair[] getCoreSet()
getCoreSet
in interface SearchState
public java.util.List<Edge> getE1()
public Edge getE1(byte fromNodeID, byte toNodeID)
public java.util.List<Edge> getE2()
public Edge getE2(byte fromNodeID, byte toNodeID)
public final Graph getG1()
getG1
in interface SearchState
public final Graph getG2()
getG2
in interface SearchState
public final java.util.List<Node> getN1()
public final Node getN1(byte nodeID)
public java.util.List<Node> getN2()
public final Node getN2(byte nodeID)
protected void setG1(Graph g1)
protected void setG2(Graph g2)