A visualization of some of the well known shortest path finding algorithms in a visibility graph.
-
Updated
Oct 24, 2021 - Java
A visualization of some of the well known shortest path finding algorithms in a visibility graph.
Improving the speed of Visibility Graph Analysis by two orders of magnitude with the help of Neural Nets. This project was conducted as part of the Final Thesis for MSc Architectural Computation, Bartlett, University College London.
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."