Object

at.logic.gapt.utils.executionModels.searchAlgorithms

SearchAlgorithms

Related Doc: package searchAlgorithms

Permalink

object SearchAlgorithms

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SearchAlgorithms
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def BFS[NodeType](root: NodeType, succ: (NodeType) ⇒ List[NodeType], goal: (NodeType) ⇒ Boolean): List[NodeType]

    Permalink

    Performs a parameterizable BFS with a custom successor function.

    Performs a parameterizable BFS with a custom successor function. See GenericSearch.

  5. def BFS[NodeType](root: NodeType, succ: (NodeType) ⇒ List[NodeType]): List[NodeType]

    Permalink

    Performs a parameterizable BFS with a custom successor function.

    Performs a parameterizable BFS with a custom successor function. See GenericSearch.

  6. def DFS[NodeType](root: NodeType, succ: (NodeType) ⇒ List[NodeType], goal: (NodeType) ⇒ Boolean): List[NodeType]

    Permalink

    Performs a parameterizable DFS with a custom successor function.

    Performs a parameterizable DFS with a custom successor function. See GenericSearch.

  7. def DFS[NodeType](root: NodeType, succ: (NodeType) ⇒ List[NodeType]): List[NodeType]

    Permalink

    Performs a parameterizable DFS with a custom successor function.

    Performs a parameterizable DFS with a custom successor function. See GenericSearch.

  8. def GenericSearch[NodeType, CollType <: SearchCollection[NodeType]](sc: CollType, root: NodeType, succ: (NodeType) ⇒ List[NodeType], goal: (NodeType) ⇒ Boolean): List[NodeType]

    Permalink

    Performs a parameterizable search with a custom collection and successor function.

    Performs a parameterizable search with a custom collection and successor function.

    Nodes which have no successors are abandoned as dead ends; nodes for which the goal function returns True are added to the list of solutions and not expanded further.

    sc

    The collection in which to store the nodes. Ex.: a stack creates a DFS, a queue a BFS.

    root

    The root node of the search.

    succ

    The successor function which takes a node and generates all valid successors.

    returns

    The list of nodes which have no successors (=goal nodes in this context).

  9. def GenericSearch[NodeType, CollType <: SearchCollection[NodeType]](sc: CollType, root: NodeType, succ: (NodeType) ⇒ List[NodeType]): List[NodeType]

    Permalink

    Performs a parameterizable search with with a custom collection and successor function.

    Performs a parameterizable search with with a custom collection and successor function.

    It is assumed that all nodes with no successors are goal nodes. and that the successor function generates no invalid nodes.

    sc

    The collection in which to store the nodes. Ex.: a stack creates a DFS, a queue a BFS.

    root

    The root node of the search.

    succ

    The successor function which takes a node and generates all valid successors.

    returns

    The list of nodes which have no successors (=goal nodes in this context).

  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. def setSearch[ElemType, NodeType <: SetNode[ElemType]](elemFilter: (NodeType, (ElemType, Int)) ⇒ Boolean, nodeFilter: (NodeType) ⇒ Boolean, node: NodeType): List[NodeType]

    Permalink

    A higher-order successor function used to turn the generic DFS into an efficient set search.

    A higher-order successor function used to turn the generic DFS into an efficient set search. The successors of a node are all nodes which contain one additional element from set of possible ones. In addition to the default constraints, the user can specify an elemFilter, which restricts the elements that can be added and a nodeFilter, which filters out generater successor nodes according to some arbitrary criterion.

    See SetNode.

    elemFilter

    Set elements which fail elemFilter won't be added to the current node's set.

    nodeFilter

    Generated successor nodes which fail nodeFilter won't be returned by this function.

    node

    The current node.

  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped