reachable_set(graph, initial_nodes, out=None)¶
Compute the safe, reachable set of a graph
Directed graph. Each edge must have associated action metadata, which specifies the action that this edge corresponds to. Each edge has an attribute [‘safe’], which is a boolean that indicates safety
List of the initial, safe nodes that are used as a starting point to compute the reachable set.
The array to write the results to. Is assumed to be False everywhere except at the initial nodes
Boolean array that indicates whether a node belongs to the reachable set.