Thank you for the information you provided. Yes, it runs an iterative algorithm on a graph and feeds the result of one iteration to the next.
The getting stuck issue disappears when increasing the maximal iterations in the algorithm ex. increase to 1000 vertex centric iterations in the algorithm, before it was 10. The algorithm finds one maximal independent set in the while loop. After some iterations it only finds maximal independent set consist of only one node. Therefore, this idea might be wrong, but I would guess the reason that join gets stuck is because it doesn't find any maximal independent set in that vertex centric iteration. This causes the graph cannot become sub-graph by filtering. -- View this message in context: http://apache-flink-incubator-user-mailing-list-archive.2336050.n4.nabble.com/Using-Spargel-s-FilterOnVerices-gets-stuck-tp743p750.html Sent from the Apache Flink (Incubator) User Mailing List archive. mailing list archive at Nabble.com.
