# [−][src]Module rustc_data_structures::graph

## ⚙️ This is an internal compiler API. (`rustc_private`

)

This crate is being loaded from the sysroot, a permanently unstable location for private compiler dependencies. It is not intended for general use. Prefer using a public version of this crate from crates.io via `Cargo.toml`

.

## Modules

dominators | Internal Algorithm citation: A Simple, Fast Dominance Algorithm. Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy Rice Computer Science TS-06-33870 https://www.cs.rice.edu/~keith/EMBED/dom.pdf |

implementation | Internal A graph module for use in dataflow, region resolution, and elsewhere. |

iterate | Internal |

reference | Internal |

scc | Internal Routine to compute the strongly connected components (SCCs) of a graph, as well as the resulting DAG if each SCC is replaced with a node in the graph. This uses Tarjan's algorithm that completes in O(n) time. |

vec_graph | Internal |

## Traits

ControlFlowGraph | Internal |

DirectedGraph | Internal |

GraphPredecessors | Internal |

GraphSuccessors | Internal |

WithNumEdges | Internal |

WithNumNodes | Internal |

WithPredecessors | Internal |

WithStartNode | Internal |

WithSuccessors | Internal |

## Functions

is_cyclic | Internal Returns |