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
