Michael Hunger
Michael Hunger
With a parameter: `index:'Label'` also efficiently write an native numeric index with `Label+writeProperty -> node-id -> value`
``` CALL algo.unionFind(null, 'OBSERVED_WITH', {write:true, graph:'huge', partitionProperty:"community",concurrency:3}) YIELD nodes, setCount, loadMillis, computeMillis, writeMillis,p1, p5,p10,p25,p50,p75,p90,p95,p100; Failed to invoke procedure `algo.unionFind`: Caused by: com.carrotsearch.hppc.BufferAllocationException: Maximum array size exceeded for this load factor...
when running louvain I wanted to stop it using ctrl-c but it didn't react, so i guess tx termination is not propery observed ``` JvmTop 0.8.0 alpha - 08:12:50, amd64,...
It should not be -1 on all accounts. ``` CALL algo.betweenness('Character','RELATED_TO', {direction:'out',write:true, writeProperty:'betweenness'}) YIELD nodes, minCentrality, maxCentrality, sumCentrality, loadMillis, computeMillis, writeMillis; +--------------------------------------------------------------------------------------------------+ | nodes | minCentrality | maxCentrality | sumCentrality...
## k-core decomposition pseudo code, we generate a new graph instance from the current one. ``` newIds = new int[nodeCount] int newId = 0 // single thread? for node :...
add optional weights positive relationship, weight > 0 negative relationship, weight
- optionally use [Neo4j Thread Pool](https://github.com/neo4j/neo4j/blob/3.2/community/kernel/src/main/java/org/neo4j/kernel/impl/util/Neo4jJobScheduler.java) like in [APOC](https://github.com/neo4j-contrib/neo4j-apoc-procedures/blob/3.1/src/main/java/apoc/ApocKernelExtensionFactory.java#L49) or via dependency resolver of GD-API