This might be hard to do. One generalization of this problem is
https://en.m.wikipedia.org/wiki/Longest_path_problem
Given a node (e.g. A), find longest path. All interior relations are transitive
and can be inferred.
But finding a distributed spark way of doing it in P time would be interesting.
Sent from my Verizon Wireless 4G LTE smartphone
-------- Original message --------
From: Guillermo Ortiz <konstt2...@gmail.com>
Date: 02/24/2016 5:26 PM (GMT-05:00)
To: user <user@spark.apache.org>
Subject: How could I do this algorithm in Spark?
I want to do some algorithm in Spark.. I know how to do it in a single machine
where all data are together, but I don't know a good way to do it in Spark.
If someone has an idea..I have some data like thisa , bx , yb , cy , yc , d
I want something like:a , db , dc , dx , yy , y
I need to know that a->b->c->d, so a->d, b->d and c->d.I don't want the code,
just an idea how I could deal with it.
Any idea?
