Computes the visibility inside a maze
-
Updated
May 4, 2024 - JavaScript
Computes the visibility inside a maze
Lector Backend
An implementation for the Shortest Path Among Obstacles for a point robot problem, using the Visibility Graph.
Visibility graph implementation to support shortest path calculations such as dijkstra or a-star
Add a description, image, and links to the visibility-graph topic page so that developers can more easily learn about it.
To associate your repository with the visibility-graph topic, visit your repo's landing page and select "manage topics."