Hi All:
I have a question about how to do the following operation in GraphX.
Suppose I have a graph with the following vertices and scores on the edges:
(V1 {type:B})-(V2 {type:A})--(V3 {type:A})-(V4
{type:B})
100 10100
I would
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
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-traversal
At 2014-08-20 10:34:50 -0700, Cesar Arevalo ce...@zephyrhealthinc.com 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
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
