pub fn build_graph(
entry: &Path,
root: &Path,
lang: &dyn LanguageSupport,
cache: &mut ParseCache,
) -> BuildResultExpand description
Build a complete ModuleGraph from the given entry point.
Phase 1 concurrently discovers files using a lock-free work queue.
Phase 2 serially constructs the graph from sorted discovery results.