lhogie / grph Goto Github PK

In the user guide http://www.i3s.unice.fr/~hogie/software/grph/doc/manuals/grph-user-manual.pdf you have written the following. I'm wondering if you could point to an example that finishes your thought at the end?

5.6.5 Parallelism
Modern computers embed a multi-core processor, enabling threads and processes
to run in parallel. In order to take advantage of this parallelism, whenever
possible split the computation in a number of independant jobs that are
executed in parallel, within distinct threads, on the local computer.
Depending on the algorithms, the speed off varies from near-to-zero to
n,nbeing the number of processors/cores available on the computer.
Grph comes with a basic parallelization framework for the execution of a
certain class of algorithms: if an algorithm can be decomposed in routines called
independently on every vertex, it may be invoked by the following code pattern:

I might be doing something wrong, but seems to me that NumericalProperty is broken when retrieving numbers as double.

NumericalProperty p = new NumericalProperty("weight");
p.setValue(0, 10);

System.out.println(p.getValueAsDouble(0)); // 4.9E-323
System.out.println(p.getValueAsInt(0)); // 10

The side effect here is that I cannot use Graph.getNeighborsAtMaxDistance because it is using getValueAsDouble internally, so the comparison with maxDistance is always true.

I tested with 1.10.8 which is described on the website as the latest release. I also found a version 4.0.0 which uses long instead of int, but the bug is there too.

It is invasive to users of the library to send usage information, especially the username, host ip, host name, os and version number. Given that the server to which this information is being sent is located in France, this collection also almost certainly runs afoul of EU laws on handling personal information: http://ec.europa.eu/justice/data-protection/data-collection/legal/index_en.htm