I am trying to run the communitiesInfomap algorithm on the following graph using embedded Pgx 2.7.0 from Java. It turns out that when I load the graph and call .undirect().simplify() the algorithm completes its execution in about 50s on my laptop. However, if I only call .simplify() after loading (that is, I do not call the undirect() method), the algorithm takes more than 48 minutes, when I decide to stop the execution. I would like to know if these numbers are reasonable (at least two orders of magnitude slower in the non-undirect case), or whether this could be caused by some sort of bug. The following is a small test to reproduce the aforementioned behavior: