Lines Matching refs:graph

7 A more flexible solution to limit the number of messages in a flow graph
9 are available in the graph and a message will not be allowed to enter
10 the graph until it can be paired with an available token. When a message
11 is retired from the graph, its token is released, and can be paired with
16 the flow graph interface, there is no explicit support for tokens, but
60      graph g;
110 back to the ``buffer_node``. This cycle in the flow graph allows the token
113 the graph. There could be three big objects in the ``function_node`` and one
117 Since there is no specific ``token_t`` defined for the flow graph, you can
135 concurrency in the graph.
143 across the entire graph.