Dear All, I've a graph with 1,000,000 nodes and 6,000,000 relationships. It's a directed, weighted graph. The nodes has just one property: number, which is unique to distinguish each node; The relationship also has just one property: weight, which decides the strength of connection between two nodes. The higher weight is, closer the pair of nodes. My computer setting: 256GB RAM, 64-core CPU Neo4j Edition: neo4j-community-2.2.0-M03 run on Linux RedHat Java Edtion: java version "1.7.0_75" Neo4j Configuration: I only set the server listen on 0.0.0.0, and no other change is applied. I want to calculate the most central nodes in this graph, i.e. the closeness centrality. First I try to user Cypher to do this. For example, I want to find the Top-100 most central nodes in this graph: MATCH (a), (b) WHERE a<>b WITH length(shortestPath((a)-[]-(b))) AS dist, a, b RETURN DISTINCT sum(1.0/dist) AS close_central, a.serial_number ORDER BY close_central DESC LIMIT 100; After running more than 1 hour, I still cannot see the output. And I use 'top' to check the CPU utility, I found Neo4j only run on core. For your information, the former Cypher query is just a test. In my scenario, I should use property weight to calculate the shortestPath. I've seen the manual, it seems there is no such Cypher Graph Algorithm to take relationship property into consideration? Or, is there other ways to calculate Closeness Centrality instead of Cypher? Thanks for your help! Best Regards! Yours, Jesse
-- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
