GraphFrames detect exclusive outbound relations
up vote
0
down vote
favorite
In my graph I need to detect vertices that do not have inbound relations. Using the example below, "a" is the only node that is not being related by the anyone.
a --> b
b --> c
c --> d
c --> b
I would really appreciate any examples to detect "a" type nodes in my graph.
Thanks
apache-spark graphframes
add a comment |
up vote
0
down vote
favorite
In my graph I need to detect vertices that do not have inbound relations. Using the example below, "a" is the only node that is not being related by the anyone.
a --> b
b --> c
c --> d
c --> b
I would really appreciate any examples to detect "a" type nodes in my graph.
Thanks
apache-spark graphframes
1
So basically you are asking for vertices with in-degree equal to 0, right?
– user6910411
Nov 10 at 22:32
after looking through the link to the docs, it appears inDegrees should be 0, right? I really hope its that easy
– webber
Nov 10 at 22:35
If my understanding of your description is correct the answer is positive.
– user6910411
Nov 11 at 19:13
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
In my graph I need to detect vertices that do not have inbound relations. Using the example below, "a" is the only node that is not being related by the anyone.
a --> b
b --> c
c --> d
c --> b
I would really appreciate any examples to detect "a" type nodes in my graph.
Thanks
apache-spark graphframes
In my graph I need to detect vertices that do not have inbound relations. Using the example below, "a" is the only node that is not being related by the anyone.
a --> b
b --> c
c --> d
c --> b
I would really appreciate any examples to detect "a" type nodes in my graph.
Thanks
apache-spark graphframes
apache-spark graphframes
asked Nov 10 at 22:27
webber
65611236
65611236
1
So basically you are asking for vertices with in-degree equal to 0, right?
– user6910411
Nov 10 at 22:32
after looking through the link to the docs, it appears inDegrees should be 0, right? I really hope its that easy
– webber
Nov 10 at 22:35
If my understanding of your description is correct the answer is positive.
– user6910411
Nov 11 at 19:13
add a comment |
1
So basically you are asking for vertices with in-degree equal to 0, right?
– user6910411
Nov 10 at 22:32
after looking through the link to the docs, it appears inDegrees should be 0, right? I really hope its that easy
– webber
Nov 10 at 22:35
If my understanding of your description is correct the answer is positive.
– user6910411
Nov 11 at 19:13
1
1
So basically you are asking for vertices with in-degree equal to 0, right?
– user6910411
Nov 10 at 22:32
So basically you are asking for vertices with in-degree equal to 0, right?
– user6910411
Nov 10 at 22:32
after looking through the link to the docs, it appears inDegrees should be 0, right? I really hope its that easy
– webber
Nov 10 at 22:35
after looking through the link to the docs, it appears inDegrees should be 0, right? I really hope its that easy
– webber
Nov 10 at 22:35
If my understanding of your description is correct the answer is positive.
– user6910411
Nov 11 at 19:13
If my understanding of your description is correct the answer is positive.
– user6910411
Nov 11 at 19:13
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53244049%2fgraphframes-detect-exclusive-outbound-relations%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
So basically you are asking for vertices with in-degree equal to 0, right?
– user6910411
Nov 10 at 22:32
after looking through the link to the docs, it appears inDegrees should be 0, right? I really hope its that easy
– webber
Nov 10 at 22:35
If my understanding of your description is correct the answer is positive.
– user6910411
Nov 11 at 19:13