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 <r.ryan.mcc...@gmail.com> wrote: > 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-traversal-tp12491p12494.html > Sent from the Apache Spark User List mailing list archive at Nabble.com. > > --------------------------------------------------------------------- > To unsubscribe, e-mail: user-unsubscr...@spark.apache.org > For additional commands, e-mail: user-h...@spark.apache.org > > -- 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
