Feature #753

Implement path search algorithm

Added by David Demelier 10 months ago. Updated 3 months ago.

Status:NewStart date:12/11/2017
Priority:NormalDue date:12/30/2017
Assignee:Michaël SCHERER% Done:

0%

Category:-Estimated time:4.00 h
Target version:-
MFD after: Bookmark:@
MFD revision: Submitted by:
Branch:default

Description

Using a 2D linearized matrix grid, implement a path search algorithm that returns a list (std::vector<mlk::point>) of coordinates needed to goes from a point A to B.

The linearized grid is a std::array<int, 20*20> where 0 is a possible grid slot while != 0 means an obstacle is present.

Synopsis of desired function:

using grid = std::array<int, 400>;

std::vector<mlk::point> path(const grid& grid, const const mlk::point& start, const mlk::point& end)
{
}

Remember, to get a a coordinate in a linearized grid, you must use the following:

grid[x + y * 20]; // 20 is grid's width

History

#1 Updated by David Demelier 10 months ago

  • Description updated (diff)

#2 Updated by David Demelier 10 months ago

  • Subject changed from Implemenent path search algorithm to Implement path search algorithm

#3 Updated by David Demelier 10 months ago

  • Description updated (diff)

#4 Updated by David Demelier 10 months ago

  • Description updated (diff)

#5 Updated by David Demelier 5 months ago

  • Assignee deleted (Anonymous)

#6 Updated by David Demelier 4 months ago

  • Target version deleted (42)

#7 Updated by Michaël SCHERER 3 months ago

  • Assignee set to Michaël SCHERER

Also available in: Atom PDF