Gérer le pathfinding avec un memory heap #16

Open
opened 3 years ago by valentin · 0 comments
Owner

Dans Entity.gd -> func pathfinding()

remplacer :

frontier.sort_custom(
			func(a, b):
				if priorities[a] < priorities[b]:
					return true
				return false
		)

par un priority queue
https://www.redblobgames.com/pathfinding/a-star/implementation.html#python-queue-with-priorities
http://theory.stanford.edu/~amitp/GameProgramming/ImplementationNotes.html#binary-heaps

Dans Entity.gd -> func pathfinding() remplacer : ``` frontier.sort_custom( func(a, b): if priorities[a] < priorities[b]: return true return false ) ``` par un priority queue https://www.redblobgames.com/pathfinding/a-star/implementation.html#python-queue-with-priorities http://theory.stanford.edu/~amitp/GameProgramming/ImplementationNotes.html#binary-heaps
valentin added the
unit
optimization
labels 3 years ago
Sign in to join this conversation.
No Milestone
No project
No Assignees
1 Participants
Notifications
Due Date

No due date set.

Dependencies

No dependencies set.

Reference: valentin/Gridmap#16
Loading…
There is no content yet.