LINUX BUG: minimum kernel crashes when k is bounded

[liamholland]

for some reason, when running with the minimum kernel with a bounded colour, the program will crash if maxColour is insufficient to colour the graph. this includes when the max is set by the benchmark. the strange part about this problem is that the program crashes when it attempts to free the various graph memory at the end of the program, after it has completed the colouring successfully. however, the colour bound has nothing to do with the graphs' memory, so why this is happening is beyond me.

the final oddity is the fact that all of this works flawlessly on windows.

normal successful output (unbounded colours):

crash when benchmark max is deficient:

note how the number of colours exceeded the benchmark

runs fine when the upper bound is sufficient

crashes when the upper bound is deficient

note how the number of colours is not sufficient

in every case, the program failed after printing the results, meaning it failed when attempting to free the memory

[liamholland]

upon the appearance of another bug, this time when using less agents than nodes and an even number of moves for each agents, i have narrowed the issue down to the freeing of the neighbours array in the freeGraph function. However, the issue is still trying to figure why the crashes even happen at all and why it has something to do with apparently unrelated parameters. for now, the solutions to these issues still elude me.

and the whole time, it still works perfectly on windows.