Hi all, is there a principled way to complete a graph that contains a cycle? The basic problem is that the initial Merge component can either complete eagerly or not. Both settings are suboptimal (if it completes not eager it will complete never, if it completes eager elements in the feedback cycle get lost).
I think that using some kind of poison pill could be used. However, is there some principled mechanism that might be used? Mit freundlichen Grüßen / Best regards Dr. Stefan Wachter Bosch Software Innovations GmbH Communications (INST-ICM/BSV-BS) Stuttgarterstr. 130 71332 Waiblingen GERMANY www.bosch-si.de www.blog.bosch-si.com<http://www.blog.bosch-si.com/> Tel. +49 711 811 58 477 Fax +49 711 811 58 100 external.stefan.wach...@bosch-si.com<mailto:daniel.mau...@bosch-si.com> -- >>>>>>>>>> Read the docs: http://akka.io/docs/ >>>>>>>>>> Check the FAQ: >>>>>>>>>> http://doc.akka.io/docs/akka/current/additional/faq.html >>>>>>>>>> Search the archives: https://groups.google.com/group/akka-user --- You received this message because you are subscribed to the Google Groups "Akka User List" group. To unsubscribe from this group and stop receiving emails from it, send an email to akka-user+unsubscr...@googlegroups.com. To post to this group, send email to akka-user@googlegroups.com. Visit this group at https://groups.google.com/group/akka-user. For more options, visit https://groups.google.com/d/optout.