Public Member Functions | |
def | __init__ |
def | __del__ |
def | start |
start graph, forking thread(s), return immediately | |
def | stop |
tells scheduler to stop and waits for it to happen | |
def | wait |
waits for scheduler to stop | |
def | is_running |
def | run |
start graph, wait for completion | |
def | topological_sort |
Return a topologically sorted list of vertices. | |
def | partition_graph |
Return a list of lists of nodes that are connected. | |
Public Attributes | |
blocks | |
scheduler |
def gnuradio::gr::flow_graph::flow_graph::__del__ | ( | self | ) |
def gnuradio::gr::flow_graph::flow_graph::__init__ | ( | self | ) |
def gnuradio::gr::flow_graph::flow_graph::is_running | ( | self | ) |
def gnuradio::gr::flow_graph::flow_graph::partition_graph | ( | self, | ||
all_v | ||||
) |
Return a list of lists of nodes that are connected.
The result is a list of disjoint graphs. The sublists are topologically sorted.
def gnuradio::gr::flow_graph::flow_graph::run | ( | self | ) |
start graph, wait for completion
def gnuradio::gr::flow_graph::flow_graph::start | ( | self | ) |
start graph, forking thread(s), return immediately
def gnuradio::gr::flow_graph::flow_graph::stop | ( | self | ) |
tells scheduler to stop and waits for it to happen
def gnuradio::gr::flow_graph::flow_graph::topological_sort | ( | self, | ||
all_v | ||||
) |
Return a topologically sorted list of vertices.
This is basically a depth-first search with checks for back edges (the non-DAG condition)
def gnuradio::gr::flow_graph::flow_graph::wait | ( | self | ) |
waits for scheduler to stop