AStar2D

package
v0.0.0-...-ae8aae0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 30, 2025 License: MIT Imports: 19 Imported by: 0

Documentation

Overview

Package AStar2D provides methods for working with AStar2D object instances.

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Advanced

type Advanced = class

Advanced exposes a 1:1 low-level instance of the class, undocumented, for those who know what they are doing.

type Any

type Any interface {
	gd.IsClass
	AsAStar2D() Instance
}

type Implementation

type Implementation = implementation

Implementation implements Interface with empty methods.

type Instance

type Instance [1]gdclass.AStar2D

An implementation of the A* algorithm, used to find the shortest path between two vertices on a connected graph in 2D space. See [AStar3D] for a more thorough explanation on how to use this class. [AStar2D] is a wrapper for [AStar3D] that enforces 2D coordinates.

See [Interface] for methods that can be overridden by a [Class] that extends it.

%!(EXTRA string=AStar2D)

var Nil Instance

Nil is a nil/null instance of the class. Equivalent to the zero value.

func New

func New() Instance

func (Instance) AddPoint

func (self Instance) AddPoint(id int, position Vector2.XY)

Adds a new point at the given position with the given identifier. The [param id] must be 0 or larger, and the [param weight_scale] must be 0.0 or greater. The [param weight_scale] is multiplied by the result of [method _compute_cost] when determining the overall cost of traveling across a segment from a neighboring point to this point. Thus, all else being equal, the algorithm prefers points with lower [param weight_scale]s to form a path. [codeblocks] [gdscript] var astar = AStar2D.new() astar.add_point(1, Vector2(1, 0), 4) # Adds the point (1, 0) with weight_scale 4 and id 1 [/gdscript] [csharp] var astar = new AStar2D(); astar.AddPoint(1, new Vector2(1, 0), 4); // Adds the point (1, 0) with weight_scale 4 and id 1 [/csharp] [/codeblocks] If there already exists a point for the given [param id], its position and weight scale are updated to the given values.

func (Instance) ArePointsConnected

func (self Instance) ArePointsConnected(id int, to_id int) bool

Returns whether there is a connection/segment between the given points. If [param bidirectional] is [code]false[/code], returns whether movement from [param id] to [param to_id] is possible through this segment.

func (Instance) AsAStar2D

func (self Instance) AsAStar2D() Instance

func (Instance) AsObject

func (self Instance) AsObject() [1]gd.Object

func (Instance) AsRefCounted

func (self Instance) AsRefCounted() [1]gd.RefCounted

func (Instance) Clear

func (self Instance) Clear()

Clears all the points and segments.

func (Instance) ConnectPoints

func (self Instance) ConnectPoints(id int, to_id int)

Creates a segment between the given points. If [param bidirectional] is [code]false[/code], only movement from [param id] to [param to_id] is allowed, not the reverse direction. [codeblocks] [gdscript] var astar = AStar2D.new() astar.add_point(1, Vector2(1, 1)) astar.add_point(2, Vector2(0, 5)) astar.connect_points(1, 2, false) [/gdscript] [csharp] var astar = new AStar2D(); astar.AddPoint(1, new Vector2(1, 1)); astar.AddPoint(2, new Vector2(0, 5)); astar.ConnectPoints(1, 2, false); [/csharp] [/codeblocks]

func (Instance) DisconnectPoints

func (self Instance) DisconnectPoints(id int, to_id int)

Deletes the segment between the given points. If [param bidirectional] is [code]false[/code], only movement from [param id] to [param to_id] is prevented, and a unidirectional segment possibly remains.

func (Instance) GetAvailablePointId

func (self Instance) GetAvailablePointId() int

Returns the next available point ID with no point associated to it.

func (Instance) GetClosestPoint

func (self Instance) GetClosestPoint(to_position Vector2.XY) int

Returns the ID of the closest point to [param to_position], optionally taking disabled points into account. Returns [code]-1[/code] if there are no points in the points pool. [b]Note:[/b] If several points are the closest to [param to_position], the one with the smallest ID will be returned, ensuring a deterministic result.

func (Instance) GetClosestPositionInSegment

func (self Instance) GetClosestPositionInSegment(to_position Vector2.XY) Vector2.XY

Returns the closest position to [param to_position] that resides inside a segment between two connected points. [codeblocks] [gdscript] var astar = AStar2D.new() astar.add_point(1, Vector2(0, 0)) astar.add_point(2, Vector2(0, 5)) astar.connect_points(1, 2) var res = astar.get_closest_position_in_segment(Vector2(3, 3)) # Returns (0, 3) [/gdscript] [csharp] var astar = new AStar2D(); astar.AddPoint(1, new Vector2(0, 0)); astar.AddPoint(2, new Vector2(0, 5)); astar.ConnectPoints(1, 2); Vector2 res = astar.GetClosestPositionInSegment(new Vector2(3, 3)); // Returns (0, 3) [/csharp] [/codeblocks] The result is in the segment that goes from [code]y = 0[/code] to [code]y = 5[/code]. It's the closest position in the segment to the given point.

func (Instance) GetIdPath

func (self Instance) GetIdPath(from_id int, to_id int) []int64

Returns an array with the IDs of the points that form the path found by AStar2D between the given points. The array is ordered from the starting point to the ending point of the path. If there is no valid path to the target, and [param allow_partial_path] is [code]true[/code], returns a path to the point closest to the target that can be reached. [codeblocks] [gdscript] var astar = AStar2D.new() astar.add_point(1, Vector2(0, 0)) astar.add_point(2, Vector2(0, 1), 1) # Default weight is 1 astar.add_point(3, Vector2(1, 1)) astar.add_point(4, Vector2(2, 0))

astar.connect_points(1, 2, false) astar.connect_points(2, 3, false) astar.connect_points(4, 3, false) astar.connect_points(1, 4, false)

var res = astar.get_id_path(1, 3) # Returns [1, 2, 3] [/gdscript] [csharp] var astar = new AStar2D(); astar.AddPoint(1, new Vector2(0, 0)); astar.AddPoint(2, new Vector2(0, 1), 1); // Default weight is 1 astar.AddPoint(3, new Vector2(1, 1)); astar.AddPoint(4, new Vector2(2, 0));

astar.ConnectPoints(1, 2, false); astar.ConnectPoints(2, 3, false); astar.ConnectPoints(4, 3, false); astar.ConnectPoints(1, 4, false); int[] res = astar.GetIdPath(1, 3); // Returns [1, 2, 3] [/csharp] [/codeblocks] If you change the 2nd point's weight to 3, then the result will be [code][1, 4, 3][/code] instead, because now even though the distance is longer, it's "easier" to get through point 4 than through point 2.

func (Instance) GetPointCapacity

func (self Instance) GetPointCapacity() int

Returns the capacity of the structure backing the points, useful in conjunction with [method reserve_space].

func (Instance) GetPointConnections

func (self Instance) GetPointConnections(id int) []int64

Returns an array with the IDs of the points that form the connection with the given point. [codeblocks] [gdscript] var astar = AStar2D.new() astar.add_point(1, Vector2(0, 0)) astar.add_point(2, Vector2(0, 1)) astar.add_point(3, Vector2(1, 1)) astar.add_point(4, Vector2(2, 0))

astar.connect_points(1, 2, true) astar.connect_points(1, 3, true)

var neighbors = astar.get_point_connections(1) # Returns [2, 3] [/gdscript] [csharp] var astar = new AStar2D(); astar.AddPoint(1, new Vector2(0, 0)); astar.AddPoint(2, new Vector2(0, 1)); astar.AddPoint(3, new Vector2(1, 1)); astar.AddPoint(4, new Vector2(2, 0));

astar.ConnectPoints(1, 2, true); astar.ConnectPoints(1, 3, true);

int[] neighbors = astar.GetPointConnections(1); // Returns [2, 3] [/csharp] [/codeblocks]

func (Instance) GetPointCount

func (self Instance) GetPointCount() int

Returns the number of points currently in the points pool.

func (Instance) GetPointIds

func (self Instance) GetPointIds() []int64

Returns an array of all point IDs.

func (Instance) GetPointPath

func (self Instance) GetPointPath(from_id int, to_id int) []Vector2.XY

Returns an array with the points that are in the path found by AStar2D between the given points. The array is ordered from the starting point to the ending point of the path. If there is no valid path to the target, and [param allow_partial_path] is [code]true[/code], returns a path to the point closest to the target that can be reached. [b]Note:[/b] This method is not thread-safe. If called from a [Thread], it will return an empty array and will print an error message.

func (Instance) GetPointPosition

func (self Instance) GetPointPosition(id int) Vector2.XY

Returns the position of the point associated with the given [param id].

func (Instance) GetPointWeightScale

func (self Instance) GetPointWeightScale(id int) Float.X

Returns the weight scale of the point associated with the given [param id].

func (Instance) HasPoint

func (self Instance) HasPoint(id int) bool

Returns whether a point associated with the given [param id] exists.

func (Instance) IsPointDisabled

func (self Instance) IsPointDisabled(id int) bool

Returns whether a point is disabled or not for pathfinding. By default, all points are enabled.

func (Instance) RemovePoint

func (self Instance) RemovePoint(id int)

Removes the point associated with the given [param id] from the points pool.

func (Instance) ReserveSpace

func (self Instance) ReserveSpace(num_nodes int)

Reserves space internally for [param num_nodes] points, useful if you're adding a known large number of points at once, such as points on a grid. New capacity must be greater or equals to old capacity.

func (Instance) SetPointDisabled

func (self Instance) SetPointDisabled(id int)

Disables or enables the specified point for pathfinding. Useful for making a temporary obstacle.

func (Instance) SetPointPosition

func (self Instance) SetPointPosition(id int, position Vector2.XY)

Sets the [param position] for the point with the given [param id].

func (Instance) SetPointWeightScale

func (self Instance) SetPointWeightScale(id int, weight_scale Float.X)

Sets the [param weight_scale] for the point with the given [param id]. The [param weight_scale] is multiplied by the result of [method _compute_cost] when determining the overall cost of traveling across a segment from a neighboring point to this point.

func (*Instance) UnsafePointer

func (self *Instance) UnsafePointer() unsafe.Pointer

func (Instance) Virtual

func (self Instance) Virtual(name string) reflect.Value

type Interface

type Interface interface {
	//Called when estimating the cost between a point and the path's ending point.
	//Note that this function is hidden in the default [AStar2D] class.
	EstimateCost(from_id int, to_id int) Float.X
	//Called when computing the cost between two connected points.
	//Note that this function is hidden in the default [AStar2D] class.
	ComputeCost(from_id int, to_id int) Float.X
}

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL