/**
 * Graph Generator
 *
 * Builds the workspace dependency graph from nx's OWN project graph
 * (createProjectGraphAsync). nx already derives those edges from BOTH source
 * imports AND package.json workspace deps, so there is no hand-maintained edge
 * list and no separate import scan — we consume what nx already computed.
 *
 *  - generateGraph()        → the FULL graph (every workspace edge nx knows).
 *                             This is what build order follows via `^build`.
 *  - generateReducedGraph() → transitive reduction of the full graph: the minimal
 *                             edge set with identical reachability, used as the
 *                             architecture VIEW written to dependencies.json.
 */
/**
 * Build the full dependency graph from nx's project graph.
 *
 * nx's `projectGraph.nodes` are the workspace projects; `projectGraph.dependencies`
 * holds every edge nx inferred (imports + package.json). We keep only edges whose
 * target is another workspace project (dropping `npm:` externals) and drop excluded
 * projects.
 *
 * Returns: { projectName: [workspaceDependencyNames] } (deps sorted, deduped)
 */
export declare function generateRawGraph(): Promise<Record<string, string[]>>;
/**
 * The full workspace dependency graph (every edge nx knows).
 */
export declare function generateGraph(): Promise<Record<string, string[]>>;
/**
 * The transitively-reduced view of the full graph. This is the canonical
 * "architecture graph" written to and validated against dependencies.json.
 *
 * Reduction is undefined on cycles; callers that care about cycles
 * (validate-no-architecture-cycles) run on the FULL graph and throw first. For the
 * view executors, the downstream topological sort also throws on any cycle.
 */
export declare function generateReducedGraph(): Promise<Record<string, string[]>>;