=str #19921 Error in documentation: Graph_cycles (#20656)

* =str 19921 Error in documentation: Graph_cycles

* =str 19921 Error in documentation: Graph_cycles
This commit is contained in:
Alexander Golubev 2016-05-31 13:28:07 +03:00 committed by Konrad Malawski
parent 6b08767137
commit 23027a2801
2 changed files with 6 additions and 0 deletions

View file

@ -235,6 +235,9 @@ Cycles in bounded stream topologies need special considerations to avoid potenti
This section shows several examples of problems that can arise from the presence of feedback arcs in stream processing
graphs.
In the following examples runnable graphs are created but do not run because each have some issue and will deadlock after start.
``Source`` variable is not defined as the nature and number of element does not matter for described problems.
The first example demonstrates a graph that contains a naive cycle.
The graph takes elements from the source, prints them, then broadcasts those elements
to a consumer (we just used ``Sink.ignore`` for now) and to a feedback arc that is merged back into the main

View file

@ -292,6 +292,9 @@ Cycles in bounded stream topologies need special considerations to avoid potenti
This section shows several examples of problems that can arise from the presence of feedback arcs in stream processing
graphs.
In the following examples runnable graphs are created but do not run because each have some issue and will deadlock after start.
``Source`` variable is not defined as the nature and number of element does not matter for described problems.
The first example demonstrates a graph that contains a naïve cycle.
The graph takes elements from the source, prints them, then broadcasts those elements
to a consumer (we just used ``Sink.ignore`` for now) and to a feedback arc that is merged back into the main stream via