Meeting Minutes M15 28.01.21 - PDevanney/Tacking-on-a-Graph GitHub Wiki

Supervisor Meeting 15 -- January 21, 2021

Patrick Devanney, Dr. Jessica Enright

Discuss what has been done this week

In the first portion of the meeting Jess and I discussed the adaptions made to the code-base over the week. The main change discussed focused on the adaptation of the is_found method for the Optimal Path route. This update changed the is_found method to remove the need to calculate the Distance to Target using Dijkstra's algorithm every iteration, but instead these values would be computed prior to the method being called and a simple dictionary look-up would be made. This has shown to increase runtime significantly.

Additionally, the code has also been updated to include appropriate commentary throughout, output of the results to a CSV file had also been completed, and further tests added and adapted.

Finally, I also began writing out - on paper - the Big O Complexity calculations for the Search and Distance algorithms. Following discussion with Jess I will transfer these over to electronic format to allow for review.

Discuss what needs to be done in the forthcoming week

For next weeks meeting, my plan is to complete my Big O complexity calculations for my code-base. Additionally, having briefly looked through the dissertation. I plan to have a thorough plan of progress completed to lay out my plan for the next week. Finally, I also wish begin my proper evaluation write-up. Jess encouraged me to create a plan based around what I want my final table to look like, what will be on the X/Y axis and to think of a good way to tell the story to gain these results.

My current evaluation statement is to evaluate the complexity/time taken against the accuracy of the effectiveness of varying levels of intelligence Towers and Targets. (Random / Heuristic / Optimal).