Hi Ankur, thank you for your response. I already looked at the sample code
you sent. And I think the modification you are referring to is on the
"tryMatch" function of the PartialMatch class. I noticed you have a case in
there that checks for a pattern match, and I think that's the code I need
to m
At 2014-08-20 10:34:50 -0700, Cesar Arevalo wrote:
> I would like to get the type B vertices that are connected through type A
> vertices where the edges have a score greater than 5. So, from the example
> above I would like to get V1 and V4.
It sounds like you're trying to find paths in the grap
Hey, thanks for your response.
And I had seen the triplets, but I'm not quite sure how the triplets would
get me that V1 is connected to V4. Maybe I need to spend more time
understanding it, I guess.
-Cesar
On Wed, Aug 20, 2014 at 10:56 AM, glxc wrote:
> I don't know if Pregel would be neces
I don't know if Pregel would be necessary since it's not iterative
You could filter the graph by looking at edge triplets, and testing if
source =B, dest =A, and edge value > 5
--
View this message in context:
http://apache-spark-user-list.1001560.n3.nabble.com/GraphX-question-about-graph-trav
