Div-check optimizations + statistics fix.

Now, the loop that checks whether each path is diverse before adding it
terminates early if it finds enough new edges, so it doesn’t bother
actually calculating the diversity of each path. If zero diverse edges
were found, it checks whether the path is exactly identical to any
previously stored path.
I also fixed a glitch in the memory measurement: modValue was being
calculated using n/numReadings instead of nk/numReadings.
Check path distance before diversity

Checks the path’s distance (O(h)) before checking its diversity
(O(h*log(lambda*k*h))), to speed things up.
Changed .gitignore, removed res.txt
Delete res.txt
Updated .gitignore
Merge branch 'master' of https://github.com/john525/JL-KSP-Implementation
.gitignore is now working