gridfind 0.1.2-alpha

path finding algorithms for 2D grid

Gridfind

Provides path finding algorithms for 2D n*m grid.

There is currently only BFS algorithm.

Features

• Breadth-First Search (BFS) algorithm for pathfinding
• Easy to use API
• Customizable grid size and nodes

Examples

import 'package:gridfind/gridfind.dart';

void main() {
  final start = Point(0, 0);
  final target = Point(2, 3);
  const size = 5;
  final grid = List.generate(size, (_) => List.generate(size, (_) => Node.idle));

  var state = BFSState.init(start, target, grid);
  final path = BFS().solve(state);

  print(path);
}

Contributing

Contributing is not currently possible.

This will change in the future.

License

This project is licensed under the MIT License.