Project

General

Profile

Feature #753

Implement path search algorithm

Added by David Demelier almost 2 years ago. Updated over 1 year ago.

Status:
New
Priority:
Normal
Category:
-
Target version:
-
Start date:
12/11/2017
Due date:
12/30/2017
% Done:

0%

Estimated time:
4.00 h
MFD after:
MFD revision:
Branch:
default
Bookmark:
@
Platform:

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 almost 2 years ago

  • Description updated (diff)
#2

Updated by David Demelier almost 2 years ago

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

Updated by David Demelier almost 2 years ago

  • Description updated (diff)
#4

Updated by David Demelier almost 2 years ago

  • Description updated (diff)
#5

Updated by David Demelier over 1 year ago

  • Assignee deleted (Anonymous)
#6

Updated by David Demelier over 1 year ago

  • Target version deleted (42)
#7

Updated by Michaël SCHERER over 1 year ago

  • Assignee set to Michaël SCHERER

Also available in: Atom PDF