After hours of bug fixing, I have now uploaded a supposedly correct version of the code. To facilitate maintenance by future volunteers, it has a bunch of comments. I am currently running a test on the full input data. For performance reasons, threads write to their own files. This way, I can use parallelism without locks. If you prefer all paths, distances, and closeness centrality values to respectively be in single files instead of thread-specific files, I can change that. However, that probably slows down the program's execution. All shortest paths within an author pair are not necessarily stored consecutively. A paths file might contain the first shortest path from author 1 to author 2, followed by the first shortest path from author 1 to author 4, followed by the second shortest path from author 1 to author 2. I can order them, if needed - again at a performance penalty. On Sunday, September 15th, 2024 at 16:52, Thomas Krichel <krichel@openlib.org> wrote:
Maybe the web site is failing but we have too many containers running.
krichel@helos:~$ ps axf | grep -c shim-runc 74
Now the box appears to be swapping and I am having a hard time running my mail.
-- Written by Thomas Krichel http://openlib.org/home/krichel on his 21653rd day.