v0.2.1

What's Changed

• Set EQUAL_EDGE_COST=false, making diagonal moves cost more than cardinal ones. This reduces path artifacts and typically speeds up search
• Corrected success condition for approximate pathfinding (pathing to neighbor of goal) with EQUAL_EDGE_COST=false
• Added support for loading and running Moving AI benchmarks using the new utility crate grid_pathfinding_benchmark and integrated these into standard benchmarks
  Full Changelog: v0.2.0...v0.2.1