Thanks for all replies.
The definition of orphaned node is what you all define, it have no
relationships to others. I did use an iteration to check each nodes in the
graph using hasRelationship(). But I just wonder whether there is a shortcut
way. It seems that the answer is No now.
Zerony
On S
"After further review..." (an American football saying we're becoming all
too familiar with)...there is a "hasRelationship()" method on Node that
returns a boolean indicating if the Node has any relationships or not...thus
an "orphan" node would return false.
-Original Message-
From: user
That would be VERY VERY useful :)
if there was a trivial way to implement this
one of the key use-cases for me is to count the number of relationships
T
On 17 Jan 2010, at 01:01, Rick Bullotta wrote:
> Since there are some cases where what might be considered "orphan"
> nodes are
> perfectly n
Since there are some cases where what might be considered "orphan" nodes are
perfectly normal use cases (a node with no relationships), I think the only
way is to iterate through all nodes and check to see if relationships exist.
Here's a broader question:
Does Neo maintain an in-memory list of r
Hi Neo4j users,
Is there a shortcut to find the orphaned nodes on in graph? Currently the
program uses a loop to check each nodes in the graph to find it is orphaned
or not. Thanks.
Zerony
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.or
5 matches
Mail list logo
