|
| graph.g = DiGraph() |
|
| graph.g1 = DiGraph() |
|
| graph.dominators = g1.compute_dominators(1) |
|
| graph.g2 = DiGraph() |
|
| graph.postdominators = g1.compute_postdominators(6) |
|
| graph.idoms = g1.compute_immediate_dominators(1) |
|
| graph.frontier = g1.compute_dominance_frontier(1) |
|
| graph.g3 = DiGraph() |
|
| graph.loops = set([(backedge, frozenset(body)) for backedge, body in g3.compute_natural_loops(1)]) |
|
| graph.sccs = set([frozenset(scc) for scc in g3.compute_strongly_connected_components()]) |
|
| graph.graph = DiGraph() |
| Check str More...
|
|
| graph.graph2 = DiGraph() |
|
| graph.graph4 = graph.copy() |
|
| graph.graph3 = DiGraph() |
|
| graph.j1 = MatchGraphJoker(name="dad") |
| Build a MatchGraph using MatchGraphJoker. More...
|
|
| graph.j2 = MatchGraphJoker(name="son") |
| Modify restrictions. More...
|
|
| graph.matcher = j1 >> j2 >> j1 |
| Check '>>' helper. More...
|
|
| graph.sols = list(matcher.match(graph)) |
|
| graph.j3 = MatchGraphJoker(name="sonson", restrict_in=False) |
|
| graph.components = graph.compute_weakly_connected_components() |
|