This week I tidied up all of the loose ends with the code, it now will make a graph that displays unknown nodes, assuming that any unresponsive hop in between any two given nodes is the same unresponsive hop. There was a bug in this code that took me a very long time to find, so that took up most of my week. Other than that, I readded the memory freeing, fixed it so it will properly escape characters when necessary in its outputs. I improved the python programme that resizes the nodes after they have been grouped so it will also remove edge weights. And I wrote a text file that explains exactly how to use the programme.