@eldrforge/tree-core 0.1.0

package/LICENSE

@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2025 Calen Varek
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+

package/README.md

@@ -0,0 +1,92 @@
+# @eldrforge/tree-core
+
+Dependency graph algorithms for monorepo package analysis.
+
+## Features
+
+- 📦 **Package Discovery** - Scan workspace for package.json files
+- 🔍 **Dependency Analysis** - Build dependency graphs
+- 📊 **Topological Sort** - Determine build order
+- ⚠️ **Circular Detection** - Identify circular dependencies
+- 🎯 **Pattern Filtering** - Exclude packages by pattern
+- 💾 **Serialization** - Save/load graphs for checkpointing
+
+## Installation
+
+```bash
+npm install @eldrforge/tree-core
+```
+
+## Usage
+
+```typescript
+import {
+  scanForPackageJsonFiles,
+  buildDependencyGraph,
+  topologicalSort
+} from '@eldrforge/tree-core';
+
+// Scan workspace for packages
+const packagePaths = await scanForPackageJsonFiles('/path/to/workspace');
+
+// Build dependency graph
+const graph = await buildDependencyGraph(packagePaths);
+
+// Get build order
+const buildOrder = topologicalSort(graph);
+
+console.log('Build order:', buildOrder);
+```
+
+## API
+
+### Package Discovery
+
+- `scanForPackageJsonFiles(directory, excludedPatterns?)` - Find all package.json files
+- `parsePackageJson(packageJsonPath)` - Parse and validate a package.json
+- `shouldExclude(packagePath, excludedPatterns)` - Check if package should be excluded
+
+### Graph Building
+
+- `buildDependencyGraph(packageJsonPaths)` - Build dependency graph from packages
+- `buildReverseGraph(edges)` - Create reverse dependency map
+
+### Graph Analysis
+
+- `topologicalSort(graph)` - Determine execution order
+- `findAllDependents(packageName, graph)` - Find all packages that depend on a package
+- `validateGraph(graph)` - Check graph integrity
+
+### Serialization
+
+- `serializeGraph(graph)` - Convert graph to JSON-serializable format
+- `deserializeGraph(serialized)` - Restore graph from serialized format
+
+## Types
+
+```typescript
+interface PackageInfo {
+  name: string;
+  version: string;
+  path: string;
+  dependencies: Set<string>;
+  devDependencies: Set<string>;
+  localDependencies: Set<string>;
+}
+
+interface DependencyGraph {
+  packages: Map<string, PackageInfo>;
+  edges: Map<string, Set<string>>;
+  reverseEdges: Map<string, Set<string>>;
+}
+```
+
+## Dependencies
+
+- `@eldrforge/git-tools` - Git operations and validation
+- `@eldrforge/shared` - Shared utilities
+
+## License
+
+MIT © Calen Varek
+

package/dist/dependencyGraph.d.ts

@@ -0,0 +1,54 @@
+import type { PackageInfo, DependencyGraph, SerializedGraph } from './types.js';
+interface Logger {
+    info(message: string, ...args: any[]): void;
+    error(message: string, ...args: any[]): void;
+    warn(message: string, ...args: any[]): void;
+    verbose(message: string, ...args: any[]): void;
+    debug(message: string, ...args: any[]): void;
+}
+export declare function setLogger(newLogger: Logger): void;
+/**
+ * Check if a package should be excluded based on patterns
+ */
+export declare function shouldExclude(packageJsonPath: string, excludedPatterns: string[]): boolean;
+/**
+ * Scan directory for package.json files
+ */
+export declare function scanForPackageJsonFiles(directory: string, excludedPatterns?: string[]): Promise<string[]>;
+/**
+ * Parse a single package.json file
+ */
+export declare function parsePackageJson(packageJsonPath: string): Promise<PackageInfo>;
+/**
+ * Build dependency graph from package.json paths
+ */
+export declare function buildDependencyGraph(packageJsonPaths: string[]): Promise<DependencyGraph>;
+/**
+ * Build reverse dependency graph (package -> dependents)
+ */
+export declare function buildReverseGraph(edges: Map<string, Set<string>>): Map<string, Set<string>>;
+/**
+ * Perform topological sort on dependency graph
+ */
+export declare function topologicalSort(graph: DependencyGraph): string[];
+/**
+ * Find all dependents of a package (packages that depend on it)
+ */
+export declare function findAllDependents(packageName: string, graph: DependencyGraph): Set<string>;
+/**
+ * Serialize graph for checkpoint persistence
+ */
+export declare function serializeGraph(graph: DependencyGraph): SerializedGraph;
+/**
+ * Deserialize graph from checkpoint
+ */
+export declare function deserializeGraph(serialized: SerializedGraph): DependencyGraph;
+/**
+ * Validate graph integrity
+ */
+export declare function validateGraph(graph: DependencyGraph): {
+    valid: boolean;
+    errors: string[];
+};
+export {};
+//# sourceMappingURL=dependencyGraph.d.ts.map

package/dist/dependencyGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.d.ts","sourceRoot":"","sources":["../src/dependencyGraph.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAGhF,UAAU,MAAM;IACZ,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAC5C,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAC7C,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAC/C,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;CAChD;AAUD,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAEjD;AAsBD;;GAEG;AACH,wBAAgB,aAAa,CAAC,eAAe,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,EAAE,GAAG,OAAO,CAc1F;AAID;;GAEG;AACH,wBAAsB,uBAAuB,CACzC,SAAS,EAAE,MAAM,EACjB,gBAAgB,GAAE,MAAM,EAAO,GAChC,OAAO,CAAC,MAAM,EAAE,CAAC,CAmDnB;AAED;;GAEG;AACH,wBAAsB,gBAAgB,CAAC,eAAe,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAyCpF;AAED;;GAEG;AACH,wBAAsB,oBAAoB,CACtC,gBAAgB,EAAE,MAAM,EAAE,GAC3B,OAAO,CAAC,eAAe,CAAC,CAiC1B;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC7B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAChC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAa1B;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,MAAM,EAAE,CAsChE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC7B,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,eAAe,GACvB,GAAG,CAAC,MAAM,CAAC,CAiBb;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,eAAe,GAAG,eAAe,CAatE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,eAAe,GAAG,eAAe,CAyB7E;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,eAAe,GAAG;IACnD,KAAK,EAAE,OAAO,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CACpB,CAuBA"}

package/dist/dependencyGraph.js

@@ -0,0 +1,306 @@
+import path from 'path';
+import fs from 'fs/promises';
+import { safeJsonParse, validatePackageJson } from '@eldrforge/git-tools';
+import { createStorage } from '@eldrforge/shared';
+let logger = {
+    info: () => { },
+    error: (...args) => console.error(...args),
+    warn: (...args) => console.warn(...args),
+    verbose: () => { },
+    debug: () => { }
+};
+export function setLogger(newLogger) {
+    logger = newLogger;
+}
+function getLogger() {
+    return logger;
+}
+/**
+ * Check if a file path matches a glob pattern
+ */
+const matchesPattern = (filePath, pattern) => {
+    // Convert simple glob patterns to regex
+    const regexPattern = pattern
+        .replace(/\\/g, '\\\\') // Escape backslashes
+        .replace(/\*\*/g, '.*') // ** matches any path segments
+        .replace(/\*/g, '[^/]*') // * matches any characters except path separator
+        .replace(/\?/g, '.') // ? matches any single character
+        .replace(/\./g, '\\.'); // Escape literal dots
+    const regex = new RegExp(`^${regexPattern}$`);
+    return regex.test(filePath) || regex.test(path.basename(filePath));
+};
+/**
+ * Check if a package should be excluded based on patterns
+ */
+export function shouldExclude(packageJsonPath, excludedPatterns) {
+    if (!excludedPatterns || excludedPatterns.length === 0) {
+        return false;
+    }
+    // Check both the full path and relative path patterns
+    const relativePath = path.relative(process.cwd(), packageJsonPath);
+    return excludedPatterns.some(pattern => matchesPattern(packageJsonPath, pattern) ||
+        matchesPattern(relativePath, pattern) ||
+        matchesPattern(path.dirname(packageJsonPath), pattern) ||
+        matchesPattern(path.dirname(relativePath), pattern));
+}
+// Types are now imported from types.ts
+/**
+ * Scan directory for package.json files
+ */
+export async function scanForPackageJsonFiles(directory, excludedPatterns = []) {
+    const logger = getLogger();
+    const packageJsonPaths = [];
+    try {
+        // First check if there's a package.json in the specified directory itself
+        const directPackageJsonPath = path.join(directory, 'package.json');
+        try {
+            await fs.access(directPackageJsonPath);
+            // Check if this package should be excluded
+            if (!shouldExclude(directPackageJsonPath, excludedPatterns)) {
+                packageJsonPaths.push(directPackageJsonPath);
+                logger.verbose(`Found package.json at: ${directPackageJsonPath}`);
+            }
+            else {
+                logger.verbose(`Excluding package.json at: ${directPackageJsonPath} (matches exclusion pattern)`);
+            }
+        }
+        catch {
+            // No package.json in the root of this directory, that's fine
+        }
+        // Then scan subdirectories for package.json files
+        const entries = await fs.readdir(directory, { withFileTypes: true });
+        for (const entry of entries) {
+            if (entry.isDirectory()) {
+                const subDirPath = path.join(directory, entry.name);
+                const packageJsonPath = path.join(subDirPath, 'package.json');
+                try {
+                    await fs.access(packageJsonPath);
+                    // Check if this package should be excluded
+                    if (shouldExclude(packageJsonPath, excludedPatterns)) {
+                        logger.verbose(`Excluding package.json at: ${packageJsonPath} (matches exclusion pattern)`);
+                        continue;
+                    }
+                    packageJsonPaths.push(packageJsonPath);
+                    logger.verbose(`Found package.json at: ${packageJsonPath}`);
+                }
+                catch {
+                    // No package.json in this directory, continue
+                }
+            }
+        }
+    }
+    catch (error) {
+        logger.error(`DEPENDENCY_GRAPH_SCAN_FAILED: Failed to scan directory | Directory: ${directory} | Error: ${error}`);
+        throw error;
+    }
+    return packageJsonPaths;
+}
+/**
+ * Parse a single package.json file
+ */
+export async function parsePackageJson(packageJsonPath) {
+    const logger = getLogger();
+    const storage = createStorage();
+    try {
+        const content = await storage.readFile(packageJsonPath, 'utf-8');
+        const parsed = safeJsonParse(content, packageJsonPath);
+        const packageJson = validatePackageJson(parsed, packageJsonPath);
+        if (!packageJson.name) {
+            throw new Error(`Package at ${packageJsonPath} has no name field`);
+        }
+        const dependencies = new Set();
+        const devDependencies = new Set();
+        // Collect all types of dependencies
+        const depTypes = ['dependencies', 'devDependencies', 'peerDependencies', 'optionalDependencies'];
+        for (const depType of depTypes) {
+            if (packageJson[depType]) {
+                Object.keys(packageJson[depType]).forEach(dep => {
+                    dependencies.add(dep);
+                    if (depType === 'devDependencies') {
+                        devDependencies.add(dep);
+                    }
+                });
+            }
+        }
+        return {
+            name: packageJson.name,
+            version: packageJson.version || '0.0.0',
+            path: path.dirname(packageJsonPath),
+            dependencies,
+            devDependencies,
+            localDependencies: new Set() // Will be populated later
+        };
+    }
+    catch (error) {
+        logger.error(`DEPENDENCY_GRAPH_PARSE_FAILED: Failed to parse package.json | Path: ${packageJsonPath} | Error: ${error}`);
+        throw error;
+    }
+}
+/**
+ * Build dependency graph from package.json paths
+ */
+export async function buildDependencyGraph(packageJsonPaths) {
+    const logger = getLogger();
+    const packages = new Map();
+    const edges = new Map();
+    // First pass: parse all package.json files
+    for (const packageJsonPath of packageJsonPaths) {
+        const packageInfo = await parsePackageJson(packageJsonPath);
+        packages.set(packageInfo.name, packageInfo);
+        logger.verbose(`Parsed package: ${packageInfo.name} at ${packageInfo.path}`);
+    }
+    // Second pass: identify local dependencies and build edges
+    for (const [packageName, packageInfo] of packages) {
+        const localDeps = new Set();
+        const edgesSet = new Set();
+        for (const dep of packageInfo.dependencies) {
+            if (packages.has(dep)) {
+                localDeps.add(dep);
+                edgesSet.add(dep);
+                logger.verbose(`${packageName} depends on local package: ${dep}`);
+            }
+        }
+        packageInfo.localDependencies = localDeps;
+        edges.set(packageName, edgesSet);
+    }
+    // Build reverse edges (dependents)
+    const reverseEdges = buildReverseGraph(edges);
+    return { packages, edges, reverseEdges };
+}
+/**
+ * Build reverse dependency graph (package -> dependents)
+ */
+export function buildReverseGraph(edges) {
+    const reverse = new Map();
+    for (const [pkg, deps] of edges) {
+        for (const dep of deps) {
+            if (!reverse.has(dep)) {
+                reverse.set(dep, new Set());
+            }
+            reverse.get(dep).add(pkg);
+        }
+    }
+    return reverse;
+}
+/**
+ * Perform topological sort on dependency graph
+ */
+export function topologicalSort(graph) {
+    const logger = getLogger();
+    const { packages, edges } = graph;
+    const visited = new Set();
+    const visiting = new Set();
+    const result = [];
+    const visit = (packageName) => {
+        if (visited.has(packageName)) {
+            return;
+        }
+        if (visiting.has(packageName)) {
+            throw new Error(`Circular dependency detected involving package: ${packageName}`);
+        }
+        visiting.add(packageName);
+        // Visit all dependencies first
+        const deps = edges.get(packageName) || new Set();
+        for (const dep of deps) {
+            visit(dep);
+        }
+        visiting.delete(packageName);
+        visited.add(packageName);
+        result.push(packageName);
+    };
+    // Visit all packages
+    for (const packageName of packages.keys()) {
+        if (!visited.has(packageName)) {
+            visit(packageName);
+        }
+    }
+    logger.verbose(`Topological sort completed. Build order determined for ${result.length} packages.`);
+    return result;
+}
+/**
+ * Find all dependents of a package (packages that depend on it)
+ */
+export function findAllDependents(packageName, graph) {
+    const dependents = new Set();
+    const visited = new Set();
+    const traverse = (pkg) => {
+        if (visited.has(pkg))
+            return;
+        visited.add(pkg);
+        const directDependents = graph.reverseEdges.get(pkg) || new Set();
+        for (const dependent of directDependents) {
+            dependents.add(dependent);
+            traverse(dependent);
+        }
+    };
+    traverse(packageName);
+    return dependents;
+}
+/**
+ * Serialize graph for checkpoint persistence
+ */
+export function serializeGraph(graph) {
+    return {
+        packages: Array.from(graph.packages.values()).map(pkg => ({
+            name: pkg.name,
+            version: pkg.version,
+            path: pkg.path,
+            dependencies: Array.from(pkg.dependencies)
+        })),
+        edges: Array.from(graph.edges.entries()).map(([pkg, deps]) => [
+            pkg,
+            Array.from(deps)
+        ])
+    };
+}
+/**
+ * Deserialize graph from checkpoint
+ */
+export function deserializeGraph(serialized) {
+    const packages = new Map();
+    const edges = new Map();
+    // Restore packages
+    for (const pkg of serialized.packages) {
+        packages.set(pkg.name, {
+            name: pkg.name,
+            version: pkg.version,
+            path: pkg.path,
+            dependencies: new Set(pkg.dependencies),
+            devDependencies: new Set(),
+            localDependencies: new Set()
+        });
+    }
+    // Restore edges
+    for (const [pkg, deps] of serialized.edges) {
+        edges.set(pkg, new Set(deps));
+    }
+    // Build reverse edges
+    const reverseEdges = buildReverseGraph(edges);
+    return { packages, edges, reverseEdges };
+}
+/**
+ * Validate graph integrity
+ */
+export function validateGraph(graph) {
+    const errors = [];
+    // Check all edge targets exist
+    for (const [pkg, deps] of graph.edges) {
+        for (const dep of deps) {
+            if (!graph.packages.has(dep)) {
+                errors.push(`Package ${pkg} depends on ${dep} which doesn't exist`);
+            }
+        }
+    }
+    // Check for circular dependencies
+    try {
+        topologicalSort(graph);
+    }
+    catch (error) {
+        errors.push(error.message);
+    }
+    return {
+        valid: errors.length === 0,
+        errors
+    };
+}
+//# sourceMappingURL=dependencyGraph.js.map

package/dist/dependencyGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.js","sourceRoot":"","sources":["../src/dependencyGraph.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,EAAE,MAAM,aAAa,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAC1E,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAYlD,IAAI,MAAM,GAAW;IACjB,IAAI,EAAE,GAAG,EAAE,GAAE,CAAC;IACd,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;IAC1C,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACxC,OAAO,EAAE,GAAG,EAAE,GAAE,CAAC;IACjB,KAAK,EAAE,GAAG,EAAE,GAAE,CAAC;CAClB,CAAC;AAEF,MAAM,UAAU,SAAS,CAAC,SAAiB;IACvC,MAAM,GAAG,SAAS,CAAC;AACvB,CAAC;AAED,SAAS,SAAS;IACd,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,cAAc,GAAG,CAAC,QAAgB,EAAE,OAAe,EAAW,EAAE;IAClE,wCAAwC;IACxC,MAAM,YAAY,GAAG,OAAO;SACvB,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAE,qBAAqB;SAC7C,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAE,+BAA+B;SACvD,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,iDAAiD;SACzE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAK,iCAAiC;SACzD,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,sBAAsB;IAEnD,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,YAAY,GAAG,CAAC,CAAC;IAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;AACvE,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,eAAuB,EAAE,gBAA0B;IAC7E,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrD,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,sDAAsD;IACtD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,eAAe,CAAC,CAAC;IAEnE,OAAO,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CACnC,cAAc,CAAC,eAAe,EAAE,OAAO,CAAC;QACxC,cAAc,CAAC,YAAY,EAAE,OAAO,CAAC;QACrC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,OAAO,CAAC;QACtD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,OAAO,CAAC,CACtD,CAAC;AACN,CAAC;AAED,uCAAuC;AAEvC;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CACzC,SAAiB,EACjB,mBAA6B,EAAE;IAE/B,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,gBAAgB,GAAa,EAAE,CAAC;IAEtC,IAAI,CAAC;QACD,0EAA0E;QAC1E,MAAM,qBAAqB,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QACnE,IAAI,CAAC;YACD,MAAM,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;YAEvC,2CAA2C;YAC3C,IAAI,CAAC,aAAa,CAAC,qBAAqB,EAAE,gBAAgB,CAAC,EAAE,CAAC;gBAC1D,gBAAgB,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;gBAC7C,MAAM,CAAC,OAAO,CAAC,0BAA0B,qBAAqB,EAAE,CAAC,CAAC;YACtE,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,OAAO,CAAC,8BAA8B,qBAAqB,8BAA8B,CAAC,CAAC;YACtG,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACL,6DAA6D;QACjE,CAAC;QAED,kDAAkD;QAClD,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAErE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACtB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;gBACpD,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;gBAE9D,IAAI,CAAC;oBACD,MAAM,EAAE,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;oBAEjC,2CAA2C;oBAC3C,IAAI,aAAa,CAAC,eAAe,EAAE,gBAAgB,CAAC,EAAE,CAAC;wBACnD,MAAM,CAAC,OAAO,CAAC,8BAA8B,eAAe,8BAA8B,CAAC,CAAC;wBAC5F,SAAS;oBACb,CAAC;oBAED,gBAAgB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;oBACvC,MAAM,CAAC,OAAO,CAAC,0BAA0B,eAAe,EAAE,CAAC,CAAC;gBAChE,CAAC;gBAAC,MAAM,CAAC;oBACL,8CAA8C;gBAClD,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,KAAK,CAAC,uEAAuE,SAAS,aAAa,KAAK,EAAE,CAAC,CAAC;QACnH,MAAM,KAAK,CAAC;IAChB,CAAC;IAED,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,eAAuB;IAC1D,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,aAAa,EAAE,CAAC;IAEhC,IAAI,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QACvD,MAAM,WAAW,GAAG,mBAAmB,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAEjE,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,cAAc,eAAe,oBAAoB,CAAC,CAAC;QACvE,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAE1C,oCAAoC;QACpC,MAAM,QAAQ,GAAG,CAAC,cAAc,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,sBAAsB,CAAC,CAAC;QACjG,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;oBAC5C,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACtB,IAAI,OAAO,KAAK,iBAAiB,EAAE,CAAC;wBAChC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC7B,CAAC;gBACL,CAAC,CAAC,CAAC;YACP,CAAC;QACL,CAAC;QAED,OAAO;YACH,IAAI,EAAE,WAAW,CAAC,IAAI;YACtB,OAAO,EAAE,WAAW,CAAC,OAAO,IAAI,OAAO;YACvC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC;YACnC,YAAY;YACZ,eAAe;YACf,iBAAiB,EAAE,IAAI,GAAG,EAAE,CAAC,0BAA0B;SAC1D,CAAC;IACN,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,KAAK,CAAC,uEAAuE,eAAe,aAAa,KAAK,EAAE,CAAC,CAAC;QACzH,MAAM,KAAK,CAAC;IAChB,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACtC,gBAA0B;IAE1B,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE7C,2CAA2C;IAC3C,KAAK,MAAM,eAAe,IAAI,gBAAgB,EAAE,CAAC;QAC7C,MAAM,WAAW,GAAG,MAAM,gBAAgB,CAAC,eAAe,CAAC,CAAC;QAC5D,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,CAAC,mBAAmB,WAAW,CAAC,IAAI,OAAO,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IACjF,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,CAAC,WAAW,EAAE,WAAW,CAAC,IAAI,QAAQ,EAAE,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACnB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClB,MAAM,CAAC,OAAO,CAAC,GAAG,WAAW,8BAA8B,GAAG,EAAE,CAAC,CAAC;YACtE,CAAC;QACL,CAAC;QAED,WAAW,CAAC,iBAAiB,GAAG,SAAS,CAAC;QAC1C,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC;IAED,mCAAmC;IACnC,MAAM,YAAY,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE9C,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC7B,KAA+B;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE/C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAChC,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IAClD,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,MAAM,KAAK,GAAG,CAAC,WAAmB,EAAQ,EAAE;QACxC,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC3B,OAAO;QACX,CAAC;QAED,IAAI,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,mDAAmD,WAAW,EAAE,CAAC,CAAC;QACtF,CAAC;QAED,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE1B,+BAA+B;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QACjD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,KAAK,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC,CAAC;IAEF,qBAAqB;IACrB,KAAK,MAAM,WAAW,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YAC5B,KAAK,CAAC,WAAW,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,0DAA0D,MAAM,CAAC,MAAM,YAAY,CAAC,CAAC;IACpG,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC7B,WAAmB,EACnB,KAAsB;IAEtB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,EAAE;QAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO;QAC7B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEjB,MAAM,gBAAgB,GAAG,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAClE,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;YACvC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC1B,QAAQ,CAAC,SAAS,CAAC,CAAC;QACxB,CAAC;IACL,CAAC,CAAC;IAEF,QAAQ,CAAC,WAAW,CAAC,CAAC;IACtB,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAsB;IACjD,OAAO;QACH,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtD,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC;SAC7C,CAAC,CAAC;QACH,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;YAC1D,GAAG;YACH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;SACnB,CAAC;KACL,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAA2B;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE7C,mBAAmB;IACnB,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACpC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;YACnB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,YAAY,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC;YACvC,eAAe,EAAE,IAAI,GAAG,EAAE;YAC1B,iBAAiB,EAAE,IAAI,GAAG,EAAE;SAC/B,CAAC,CAAC;IACP,CAAC;IAED,gBAAgB;IAChB,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;QACzC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,sBAAsB;IACtB,MAAM,YAAY,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE9C,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,KAAsB;IAIhD,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,+BAA+B;IAC/B,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACpC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,WAAW,GAAG,eAAe,GAAG,sBAAsB,CAAC,CAAC;YACxE,CAAC;QACL,CAAC;IACL,CAAC;IAED,kCAAkC;IAClC,IAAI,CAAC;QACD,eAAe,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAAC,OAAO,KAAU,EAAE,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO;QACH,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;KACT,CAAC;AACN,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * @eldrforge/tree-core
+ *
+ * Dependency graph algorithms for monorepo package analysis.
+ */
+export type { PackageInfo, DependencyGraph, SerializedGraph } from './types.js';
+export { scanForPackageJsonFiles, parsePackageJson, shouldExclude } from './dependencyGraph.js';
+export { buildDependencyGraph, buildReverseGraph } from './dependencyGraph.js';
+export { topologicalSort, findAllDependents, validateGraph } from './dependencyGraph.js';
+export { serializeGraph, deserializeGraph } from './dependencyGraph.js';
+export { setLogger } from './dependencyGraph.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,YAAY,EAAE,WAAW,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAGhF,OAAO,EACH,uBAAuB,EACvB,gBAAgB,EAChB,aAAa,EAChB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACH,oBAAoB,EACpB,iBAAiB,EACpB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACH,eAAe,EACf,iBAAiB,EACjB,aAAa,EAChB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACH,cAAc,EACd,gBAAgB,EACnB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/index.js

@@ -0,0 +1,16 @@
+/**
+ * @eldrforge/tree-core
+ *
+ * Dependency graph algorithms for monorepo package analysis.
+ */
+// Package discovery
+export { scanForPackageJsonFiles, parsePackageJson, shouldExclude } from './dependencyGraph.js';
+// Graph building
+export { buildDependencyGraph, buildReverseGraph } from './dependencyGraph.js';
+// Graph analysis
+export { topologicalSort, findAllDependents, validateGraph } from './dependencyGraph.js';
+// Serialization
+export { serializeGraph, deserializeGraph } from './dependencyGraph.js';
+// Logger configuration
+export { setLogger } from './dependencyGraph.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH,oBAAoB;AACpB,OAAO,EACH,uBAAuB,EACvB,gBAAgB,EAChB,aAAa,EAChB,MAAM,sBAAsB,CAAC;AAE9B,iBAAiB;AACjB,OAAO,EACH,oBAAoB,EACpB,iBAAiB,EACpB,MAAM,sBAAsB,CAAC;AAE9B,iBAAiB;AACjB,OAAO,EACH,eAAe,EACf,iBAAiB,EACjB,aAAa,EAChB,MAAM,sBAAsB,CAAC;AAE9B,gBAAgB;AAChB,OAAO,EACH,cAAc,EACd,gBAAgB,EACnB,MAAM,sBAAsB,CAAC;AAE9B,uBAAuB;AACvB,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Information about a single package
+ */
+export interface PackageInfo {
+    name: string;
+    version: string;
+    path: string;
+    dependencies: Set<string>;
+    devDependencies: Set<string>;
+    localDependencies: Set<string>;
+}
+/**
+ * Dependency graph structure
+ */
+export interface DependencyGraph {
+    packages: Map<string, PackageInfo>;
+    edges: Map<string, Set<string>>;
+    reverseEdges: Map<string, Set<string>>;
+}
+/**
+ * Serialized graph for checkpointing
+ */
+export interface SerializedGraph {
+    packages: Array<{
+        name: string;
+        version: string;
+        path: string;
+        dependencies: string[];
+    }>;
+    edges: Array<[string, string[]]>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,WAAW;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B,eAAe,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,iBAAiB,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAClC;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC5B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACnC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAChC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC5B,QAAQ,EAAE,KAAK,CAAC;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,YAAY,EAAE,MAAM,EAAE,CAAC;KAC1B,CAAC,CAAC;IACH,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;CACpC"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":""}

package/package.json

@@ -0,0 +1,56 @@
+{
+  "name": "@eldrforge/tree-core",
+  "version": "0.1.0",
+  "description": "Dependency graph algorithms for monorepo package analysis",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "type": "module",
+  "scripts": {
+    "build": "tsc",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "lint": "eslint src tests --ext .ts",
+    "clean": "rm -rf dist coverage",
+    "prepublishOnly": "npm run clean && npm run build && npm test"
+  },
+  "keywords": [
+    "dependency-graph",
+    "monorepo",
+    "package-analysis",
+    "topological-sort",
+    "dependency-resolution"
+  ],
+  "author": "Calen Varek <calenvarek@gmail.com>",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/calenvarek/tree-core.git"
+  },
+  "bugs": {
+    "url": "https://github.com/calenvarek/tree-core/issues"
+  },
+  "homepage": "https://github.com/calenvarek/tree-core#readme",
+  "dependencies": {
+    "@eldrforge/git-tools": "^0.1.6",
+    "@eldrforge/shared": "^0.1.0"
+  },
+  "devDependencies": {
+    "@types/node": "^22.10.2",
+    "@typescript-eslint/eslint-plugin": "^8.18.1",
+    "@typescript-eslint/parser": "^8.18.1",
+    "@vitest/coverage-v8": "^2.1.8",
+    "eslint": "^9.17.0",
+    "typescript": "^5.7.2",
+    "vitest": "^2.1.8"
+  },
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ]
+}
+