Hi,
I am searching for an optimal way to find a commonly connected nodes to a
set of nodes in a graph.
Consider the case where n1, n2, n3, n4 ,n5 are 5 nodes in a graph. These 5
are connected to the other nodes.
I need to find the nodes in the graph which are connected all above 5 nodes
Hi,
A doubt regarding traverser.
I created a network with 8 nodes and relations between the nodes are:
node1 - node2
node1 - node4
node1 - node6
node1 - node3
node1 - node7
node2 - node3
node2 - node8
node4 - node5
node6 - node7
node3 - node8
node1, node3, node5, node7and node8 have the name
Hi,
I am newbie to neo4j and I am enjoying it.
I have started to create nodes, relationships and assigning properties to
the nodes etc.
I've got a problem in accessing relationships of a node.
If 'knows = DynamicRelationshipType.withName(KNOWS)' is a relation
defined.
When a relationship
Hi,
A clarification regarding the properties of nodes.
If I am not wrong two nodes can have same value for similar property.
For example:
node1.setProperty(name, Sumanth),
node2.setProperty(name, Sumanth) is valid.
node1 and node2 have same value Sumanth for the property name.
4 matches
Mail list logo