Package org.graph4j.isomorphism

Interface State

All Known Implementing Classes:
AbstractState, AbstractUllmanState, AbstractVF2State, UllmanExactState, UllmanSubState, VF2ExactState, VF2SubState
public interface State
Interface for the state of the search algorithm. A state is a partial solution of the graph isomorphism problem.
Author:
Ignat Gabriel-Andrei

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    static final boolean
    DEBUG
     
    static final int
    NULL_NODE
     

  • Method Summary

    Modifier and Type
    Method
    Description
    void
    addPair()
    Adds the current pair of vertices to the mapping.
    void
    backTrack()
    Backtracks to the previous state.
    int
    getCoreLen()
     
    Isomorphism
    getMapping()
    Return the mapping of the current state
    boolean
    isDead()
    Checks if the current state is a dead end(no solution can be found from here).
    boolean
    isFeasiblePair()
    Checks if the current pair of vertices is feasible.
    boolean
    isGoal()
    Checks if the current state is a goal state(a complete solution was found).
    boolean
    nextPair()
    Computes the next pair of vertices to be added to the mapping.
    void
    resetPreviousVertices()
     

  • Field Details

  • Method Details

    • nextPair

      boolean nextPair()
      Computes the next pair of vertices to be added to the mapping. Return true if a pair was found, false otherwise

    • isFeasiblePair

      boolean isFeasiblePair()
      Checks if the current pair of vertices is feasible. Return true if the pair is feasible, false otherwise

    • isDead

      boolean isDead()
      Checks if the current state is a dead end(no solution can be found from here). Return true if the state is a dead end, false otherwise

    • isGoal

      boolean isGoal()
      Checks if the current state is a goal state(a complete solution was found). Return true if the state is a goal state, false otherwise

    • addPair

      void addPair()
      Adds the current pair of vertices to the mapping.

    • backTrack

      void backTrack()
      Backtracks to the previous state.

    • getMapping

      Isomorphism getMapping()
      Return the mapping of the current state

    • resetPreviousVertices

      void resetPreviousVertices()

    • getCoreLen

      int getCoreLen()