This JavaFX application allows the user to search for and find routes between stations on the Vienna U-Bahn railway system. This data structures project demonstrates BFS, DFS, and Dijkstra’s search algorithms.
This app, a university assignment, was developed to compare the performance of BFS, DFS, and Dijkstra’s search algorithms. In a real world application it's likely that an A* algorithm would give better performance.
As the intention was to test search algorithms, only basic mapping was developed. For an example of image analysis and edge detection see my Image Analysis Blood Cell Slide Analysis project.
