Tamás Nepusz

You can pass `-DIEEE754_DOUBLE_ENDIANNESS_MATCHES:BOOL=ON` to `cmake` to skip the check that throws this error. On the other hand, I wonder why this test fails and whether we can do something...

Also, note that before [igraph commit efa91da](https://github.com/igraph/igraph/commit/efa91da1adf7e12d917597d50ffce23c17d6e7a7), this did not cause problems because this pre-test was not run at all - it was skipped for all cross-compilation builds. In that...

Well, I'm getting this as the output and I don't know whether this is what I should get or not: ``` NYI: printf null 0 ``` I guess that the...

Looks good to me so far! Please mark this as "ready for review" if you'd like us to merge this as-is, without running the unit tests. As for the built...

Most of the examples that you have shown above have sinks or sources; the Arnoldi method might have a problem with these, although in theory it shouldn't of course. PRPACK...

> What does it mean some? Can the .F90 files be excluded? No, I don't think so; I've attempted a conversion a few months ago and it seemed to me...

Sorry, this has slipped through the cracks somehow. Yes, I'd simply use the number of pairs as an approximation.

Here's the result of a quick profiling run on a geometric random graph with 1000 vertices and a radius of 0.2. (This should be dense enough so that the initial...

`igraph_i_vertex_connectivity_undirected()` is quite wasteful in the sense that it first converts the graph to a directed one, and then runs the s-t connectivity on all i-j pairs, even though it...

Could it be the case that the difference lies in the fact that we use incidence lists instead of adjacency lists in the algorithm, anticipating the possibility of multiple edges...