Re: [graphframes]how Graphframes Deal With Bidirectional Relationships
But, is it not possible to compute with both directions of an edge like it happens with graphX ? On 02/20/2018 03:01 AM, Felix Cheung wrote: Generally that would be the approach. But since you have effectively double the number of edges this will likely affect the scale your job will run. *From:* xiaobo *Sent:* Monday, February 19, 2018 3:22:02 AM *To:* user@spark.apache.org *Subject:* [graphframes]how Graphframes Deal With Bidirectional Relationships Hi, To represent a bidirectional relationship, one solution is to insert two edges for the vertices pair, my question is do the algorithms of graphframes still work when we doing this. Thanks
Re: [graphframes]how Graphframes Deal With Bidirectional Relationships
Generally that would be the approach. But since you have effectively double the number of edges this will likely affect the scale your job will run. From: xiaobo Sent: Monday, February 19, 2018 3:22:02 AM To: user@spark.apache.org Subject: [graphframes]how Graphframes Deal With Bidirectional Relationships Hi, To represent a bidirectional relationship, one solution is to insert two edges for the vertices pair, my question is do the algorithms of graphframes still work when we doing this. Thanks
[graphframes]how Graphframes Deal With Bidirectional Relationships
Hi, To represent a bidirectional relationship, one solution is to insert two edges for the vertices pair, my question is do the algorithms of graphframes still work when we doing this. Thanks