On Wed, Nov 2, 2011 at 11:54 AM, D. Frej wrote:
> my use case is the following:
> - a principal in a group has access to all other principals in a group
> => therefore I need to go one level up to find the other principals in
> the group
> - additionally: if there is another group as principal in
my use case is the following:
- a principal in a group has access to all other principals in a group
=> therefore I need to go one level up to find the other principals in
the group
- additionally: if there is another group as principal in a group
(UserGroup 1 is in UserGroup 2) , then the princ
If I understand you correctly, then your start nodes (aka "UserGroup 2") would
be dangling as there is no
relationship IS_MEMBER_OF starting from this group.
so your start nodes are connected by an optional relationship, so everything
also hanging on this optional relationship is also optional.
I though that this is what I used with
MATCH (principals)-[?:IS_MEMBER_OF]->
When I turn it into
MATCH (principals)-[?]->()<-[:IS_MEMBER_OF*0..]-(n)
RETURN n
Nothing at all is returned
Am 02.11.2011 11:05, schrieb Jacob Hansson:
> On Wed, Nov 2, 2011 at 11:01 AM, D. Frej wrote:
>
>> Hi,
>>
>
On Wed, Nov 2, 2011 at 11:01 AM, D. Frej wrote:
> Hi,
>
> I have a very simply graph:
>
> UserGroup 2 <-[:IS_MEMBER_OF]- UserGroup 1, User 3
> UserGroup 1 <-[:IS_MEMBER_OF]- User 1, User 2
>
> I want to find all nodes that are on the same level or on a level below
> the starting point. Using
>
>
Hi,
I have a very simply graph:
UserGroup 2 <-[:IS_MEMBER_OF]- UserGroup 1, User 3
UserGroup 1 <-[:IS_MEMBER_OF]- User 1, User 2
I want to find all nodes that are on the same level or on a level below
the starting point. Using
START principals=node:nodes(NAME='User 3')
MATCH (principals)-[?:IS
6 matches
Mail list logo
