Hi!
Yes, looks like quite a graph problem. The best way to get started with
that is to have a look at Gelly:
https://ci.apache.org/projects/flink/flink-docs-release-0.10/libs/gelly_guide.html
Beware: The problem you describe (all possible paths between all pairs of
points) results in an exponential number of results, which is inherently
neither efficiently computable nor storable for anything but small graphs.
To connect Flink to Cassandra, you can simply use the Hadoop Cassandra
source/sink with Flink:
- https://wiki.apache.org/cassandra/HadoopSupport
-
https://ci.apache.org/projects/flink/flink-docs-release-0.10/apis/hadoop_compatibility.html#using-hadoop-inputformats
Greetings,
Stephan
On Wed, Nov 25, 2015 at 1:54 PM, RahadianBayu Permadi <
rahadian.bayu.perm...@gmail.com> wrote:
> Greetings,
>
> I am a newbie in this flink world. Thanks to Slim Baltagi for recommending
> this Flink community.
>
> I have a graph problem. So I have some points and paths among those
> points. Each path has some value like distance that determine the distance
> between two points it's connecting.
>
> So far it s quite a graph representation. I want to create a system that
> can find all possible paths (not just the shortest path) from point A to
> point B (any pair of points in the graph).
>
> My questions are:
> 1. How would flink solve this?
> 2. Any suggestion data storage for this? Any suggestion on how to use
> Cassandra with flink?
>
> Thanks in advanced.
>
> Best Regards,
> Bayu
>
