Struct DominatorTree 

pub struct DominatorTree {
    pub idom: Vec<i32>,
    pub tree: Graph,
    pub leftout: Vec<VertexId>,
}

Result of dominator_tree.

Fields

idom: Vec<i32>

Immediate-dominator vector of length vcount.

• idom[root] == -1,
• idom[v] == -2 for every vertex v unreachable from root,
• idom[v] == idom_vertex_id otherwise (always >= 0 and < vcount).

tree: Graph

Directed graph on the same vertex set as the input. Contains exactly one edge per non-root reachable vertex; orientation is dictated by mode (Out ⇒ idom(w) → w, In ⇒ w → idom(w)). Vertices in Self::leftout appear as isolates.

leftout: Vec<VertexId>

Vertex ids unreachable from root, in ascending order. Empty when the graph is a proper flowgraph (every vertex reachable from root).

Trait Implementations

impl Clone for DominatorTree

fn clone(&self) -> DominatorTree

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DominatorTree

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.