Decompose the graph on predecessors of the focused node, following
incoming edges labeled with b
.
Decompose the graph on predecessors of the focused node, following
incoming edges labeled with b
.
O(n) in the degree of the focused node.
Recursively decompose the graph, passing each decomposition to the given function, storing the results as labels.
Recursively decompose the graph, passing each decomposition to the given function,
storing the results as labels. The resulting decomposition has the exact same structure as
this one, just redecorated with new labels. This differs from redecorate
in that calls to
f
see successively smaller subgraphs as each decomposition removes a node.
Decompose the graph on successors of the focused node, following
outgoing edges labeled with b
.
Decompose the graph on successors of the focused node, following
outgoing edges labeled with b
.
O(n) in the degree of the focused node.
Decompose the graph on predecessors of the focused node.
Decompose the graph on predecessors of the focused node. O(n) in the outdegree of the focused node.
Get the label of the node under focus
Map over the labels in this decomposition
Decompose the graph on the nodes returned by f
.
Decompose the graph on the nodes returned by f
.
O(n) in the degree of the focused node.
Decompose the graph on successors of the focused node.
Decompose the graph on successors of the focused node. O(n) in the indegree of the focused node.
Decompose the graph on each node in turn, and apply the given function on each such "rotation", storing the results as labels.
Decompose the graph on each node in turn, and apply the given function on each such "rotation",
storing the results as labels. The resulting decomposition has the exact same structure as
this one, just redecorated with new labels. This differs from extend
in that each call to f
sees the entire graph from different perspectives.
The decomposition of a graph into a detached context focused on one node, and the rest of the graph.