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 modify.
I'll let you know how it goes. -Cesar On Wed, Aug 20, 2014 at 2:14 PM, Ankur Dave <ankurd...@gmail.com> wrote: > 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 find paths in the graph that match a > particular pattern. I wrote a prototype for doing that using the Pregel API > [1, 2] in response to an earlier question on the mailing list [3]. That > code won't solve your problem immediately, since it requires exact vertex > and edge attribute matches rather than predicates like "greater than 5," > but it should be easy to modify it appropriately. > > Ankur > > [1] > https://github.com/ankurdave/spark/blob/PatternMatching/graphx/src/main/scala/org/apache/spark/graphx/lib/PatternMatching.scala > [2] > https://github.com/ankurdave/spark/blob/PatternMatching/graphx/src/test/scala/org/apache/spark/graphx/lib/PatternMatchingSuite.scala > [3] > http://apache-spark-user-list.1001560.n3.nabble.com/Graphx-traversal-and-merge-interesting-edges-td8788.html > -- Cesar Arevalo Software Engineer ❘ Zephyr Health 450 Mission Street, Suite #201 ❘ San Francisco, CA 94105 m: +1 415-571-7687 ❘ s: arevalocesar | t: @zephyrhealth <https://twitter.com/zephyrhealth> o: +1 415-529-7649 ❘ f: +1 415-520-9288 http://www.zephyrhealth.com
