Module models/path/a-star/a-star_download

Type declaration

• heuristics: { diagonal: any; manhattan: any }

  • diagonal: function

    • diagonal(pos0: SimpleVector2, pos1: SimpleVector2): number

    • Parameters

      • pos0: SimpleVector2

      • pos1: SimpleVector2

      Returns number

  • manhattan: function

    • manhattan(pos0: SimpleVector2, pos1: SimpleVector2): number

    • Parameters

      • pos0: SimpleVector2

      • pos1: SimpleVector2

      Returns number

• cleanNode: function

  • cleanNode(node: GridNode): void

  • Parameters

    • node: GridNode

    Returns void

• search: function

  • search(graph: Graph, start: GridNode, end: GridNode, options?: { closest?: boolean; heuristic?: any }): GridNode[]

  • Perform an A* Search on a graph given a start and end node.

    [options.closest] Specifies whether to return the path to the closest node if the target is unreachable. [options.heuristic] Heuristic function (see astar.heuristics).

    Parameters

    • graph: Graph

    • start: GridNode

    • end: GridNode

    • options: { closest?: boolean; heuristic?: any } = {}

      • Optional closest?: boolean

      • Optional heuristic?: any

    Returns GridNode[]