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
Tel. +49 711 811 58 477
Fax +49 711 811 58 100
>>>>>>>>>> Read the docs: http://akka.io/docs/
>>>>>>>>>> Check the FAQ:
>>>>>>>>>> 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 post to this group, send email to firstname.lastname@example.org.
Visit this group at https://groups.google.com/group/akka-user.
For more options, visit https://groups.google.com/d/optout.