Neo4j

There is a relatively simple graph, where the edge has weight. I would like to subdivide graph based on minimum weights. When one node is part of one sub-graph, it can't be part of a different sub-graph.input parameter is the max. size of the sub-gra...

I have connected to a community db remotely and I have created an enterprise db. (developer licence) When I would like to start the enterprise db, it complains that it needs to change some of the port. After changing the port, the db hangs and won't ...

There is an undirected weighted graph. The weights are costs. I would like to find all the k-nearest neighbour. (k or less than k, but more than a specified number) When you found the most similar connected nodes, you need to "exclude" them from the ...