My bachelor project
In my Bachelor Project at Aarhus University, we researched and implemented different algorithms to find the shortest path in a graph with nodes and edges. We worked with Dijkstra, A*, Landmarks, Reach and Contraction Hierarchies. The project was about 60/40 on implementation and theory and can be found at my GitHub repo .
Working with the project I have learned how to structure a bigger project in Java and how to work in groups on programming projects. I have learned about managing a git repo and how to handle commits, push, pull and merge conflicts in IntelliJ.
We used JavaFX for the graphical representation and all the code have been made in Java. Working with the algorithms I learned a lot about Sets, Maps, Lists and how to handle memory efficient and how to avoid getting too much overhead. I also learned how to handle Threads in Java and making the UI work concurrently with computations.