@fuzdev/fuz_gitops 0.65.1 → 0.65.2

package/dist/dependency_graph.d.ts

@@ -1,7 +1,8 @@
 /**
  * Dependency graph data structure and algorithms for multi-repo publishing.
  *
- * Provides `DependencyGraph` class with topological sort and cycle detection.
+ * Provides `DependencyGraph` class with topological sort (via `@fuzdev/fuz_util/sort.js`)
+ * and cycle detection by dependency type.
  * For validation workflow and publishing order computation, see `graph_validation.ts`.
  *
  * @module
@@ -43,6 +44,7 @@ export interface DependencyNode {
     publishable: boolean;
 }
 export declare class DependencyGraph {
+    #private;
     nodes: Map<string, DependencyNode>;
     edges: Map<string, Set<string>>;
     constructor();
@@ -53,8 +55,8 @@ export declare class DependencyGraph {
     /**
      * Computes topological sort order for dependency graph.
      *
-     * Uses Kahn's algorithm with alphabetical ordering within tiers for
-     * deterministic results. Throws if cycles detected.
+     * Delegates to `@fuzdev/fuz_util/sort.js` for the sorting algorithm.
+     * Throws if cycles detected.
      *
      * @param exclude_dev if true, excludes dev dependencies to break cycles.
      *   Publishing uses exclude_dev=true to handle circular dev deps.
@@ -62,7 +64,6 @@ export declare class DependencyGraph {
      * @throws {Error} if circular dependencies detected in included dependency types
      */
     topological_sort(exclude_dev?: boolean): Array<string>;
-    detect_cycles(): Array<Array<string>>;
     /**
      * Detects circular dependencies, categorized by severity.
      *

package/dist/dependency_graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dependency_graph.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/dependency_graph.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAG/C,eAAO,MAAM,eAAe;;;;CAIlB,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAEpF,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,cAAc,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,mBAAmB;IACnC,KAAK,EAAE,KAAK,CAAC;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,KAAK,CAAC;YAAC,IAAI,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,cAAc,CAAA;SAAC,CAAC,CAAC;QAC1D,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1B,WAAW,EAAE,OAAO,CAAC;KACrB,CAAC,CAAC;IACH,KAAK,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAC,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC1C,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,WAAW,EAAE,OAAO,CAAC;CACrB;AAED,qBAAa,eAAe;IAC3B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACnC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;;IAOzB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI;IAoDrD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAIlD,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAIzC,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC;IAK3D;;;;;;;;;;OAUG;IACH,gBAAgB,CAAC,WAAW,UAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;IAuEpD,aAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAqCrC;;;;;;;;;;OAUG;IACH,qBAAqB,IAAI;QACxB,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;KACjC;IA2FD,MAAM,IAAI,mBAAmB;CAqB7B;AAED;;GAEG;AACH,qBAAa,sBAAsB;IAClC;;;;;;;;OAQG;IACH,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,eAAe;IAM1D;;;;;;;;;OASG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC;IAI/D,OAAO,CAAC,KAAK,EAAE,eAAe,GAAG;QAChC,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACjC,aAAa,EAAE,KAAK,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAC,CAAC,CAAC;QAClE,aAAa,EAAE,KAAK,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAC,CAAC,CAAC;KACjD;CAmBD"}
+{"version":3,"file":"dependency_graph.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/dependency_graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAE/C,eAAO,MAAM,eAAe;;;;CAIlB,CAAC;AAEX,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,OAAO,eAAe,CAAC,CAAC;AAEpF,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,cAAc,CAAC;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,mBAAmB;IACnC,KAAK,EAAE,KAAK,CAAC;QACZ,IAAI,EAAE,MAAM,CAAC;QACb,OAAO,EAAE,MAAM,CAAC;QAChB,YAAY,EAAE,KAAK,CAAC;YAAC,IAAI,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,cAAc,CAAA;SAAC,CAAC,CAAC;QAC1D,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1B,WAAW,EAAE,OAAO,CAAC;KACrB,CAAC,CAAC;IACH,KAAK,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAC,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC1C,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,WAAW,EAAE,OAAO,CAAC;CACrB;AAED,qBAAa,eAAe;;IAC3B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACnC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;;IAOzB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI;IAoDrD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAIlD,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAIzC,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC;IAK3D;;;;;;;;;;OAUG;IACH,gBAAgB,CAAC,WAAW,UAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;IAiBpD;;;;;;;;;;OAUG;IACH,qBAAqB,IAAI;QACxB,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;KACjC;IAkDD,MAAM,IAAI,mBAAmB;CAqB7B;AAED;;GAEG;AACH,qBAAa,sBAAsB;IAClC;;;;;;;;OAQG;IACH,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,eAAe;IAM1D;;;;;;;;;OASG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC;IAI/D,OAAO,CAAC,KAAK,EAAE,eAAe,GAAG;QAChC,iBAAiB,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxC,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACjC,aAAa,EAAE,KAAK,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAC,CAAC,CAAC;QAClE,aAAa,EAAE,KAAK,CAAC;YAAC,GAAG,EAAE,MAAM,CAAC;YAAC,GAAG,EAAE,MAAM,CAAA;SAAC,CAAC,CAAC;KACjD;CAmBD"}

package/dist/dependency_graph.js

@@ -1,12 +1,14 @@
 /**
  * Dependency graph data structure and algorithms for multi-repo publishing.
  *
- * Provides `DependencyGraph` class with topological sort and cycle detection.
+ * Provides `DependencyGraph` class with topological sort (via `@fuzdev/fuz_util/sort.js`)
+ * and cycle detection by dependency type.
  * For validation workflow and publishing order computation, see `graph_validation.ts`.
  *
  * @module
  */
 import { EMPTY_OBJECT } from '@fuzdev/fuz_util/object.js';
+import { topological_sort as topological_sort_generic } from '@fuzdev/fuz_util/sort.js';
 export const DEPENDENCY_TYPE = {
     PROD: 'prod',
     PEER: 'peer',
@@ -77,8 +79,8 @@ export class DependencyGraph {
     /**
      * Computes topological sort order for dependency graph.
      *
-     * Uses Kahn's algorithm with alphabetical ordering within tiers for
-     * deterministic results. Throws if cycles detected.
+     * Delegates to `@fuzdev/fuz_util/sort.js` for the sorting algorithm.
+     * Throws if cycles detected.
      *
      * @param exclude_dev if true, excludes dev dependencies to break cycles.
      *   Publishing uses exclude_dev=true to handle circular dev deps.
@@ -86,97 +88,21 @@ export class DependencyGraph {
      * @throws {Error} if circular dependencies detected in included dependency types
      */
     topological_sort(exclude_dev = false) {
-        const visited = new Set();
-        const result = [];
-        // Count incoming edges for each node
-        const in_degree = new Map();
-        for (const name of this.nodes.keys()) {
-            in_degree.set(name, 0);
-        }
-        for (const node of this.nodes.values()) {
-            for (const [dep_name, spec] of node.dependencies) {
-                // Skip dev dependencies if requested
+        const items = Array.from(this.nodes.values()).map((node) => ({
+            id: node.name,
+            depends_on: Array.from(node.dependencies.entries())
+                .filter(([dep_name, spec]) => {
                 if (exclude_dev && spec.type === DEPENDENCY_TYPE.DEV)
-                    continue;
-                if (this.nodes.has(dep_name)) {
-                    in_degree.set(node.name, in_degree.get(node.name) + 1);
-                }
-            }
-        }
-        // Start with nodes that have no dependencies
-        const queue = [];
-        for (const [name, degree] of in_degree) {
-            if (degree === 0) {
-                queue.push(name);
-            }
-        }
-        // Sort initial queue alphabetically for deterministic ordering within tier
-        queue.sort();
-        // Process nodes
-        while (queue.length > 0) {
-            const name = queue.shift();
-            result.push(name);
-            visited.add(name);
-            // Reduce in-degree for dependents
-            const node = this.nodes.get(name);
-            if (node) {
-                // Find packages that depend on this one
-                // Sort nodes to ensure deterministic iteration order
-                const sorted_nodes = Array.from(this.nodes.values()).sort((a, b) => a.name.localeCompare(b.name));
-                for (const other_node of sorted_nodes) {
-                    for (const [dep_name, spec] of other_node.dependencies) {
-                        // Skip dev dependencies if requested
-                        if (exclude_dev && spec.type === DEPENDENCY_TYPE.DEV)
-                            continue;
-                        if (dep_name === name) {
-                            const new_degree = in_degree.get(other_node.name) - 1;
-                            in_degree.set(other_node.name, new_degree);
-                            if (new_degree === 0) {
-                                queue.push(other_node.name);
-                            }
-                        }
-                    }
-                }
-            }
-        }
-        // Check for cycles
-        if (result.length !== this.nodes.size) {
-            const unvisited = Array.from(this.nodes.keys()).filter((n) => !visited.has(n));
-            throw new Error(`Circular dependency detected involving: ${unvisited.join(', ')}`);
-        }
-        return result;
-    }
-    detect_cycles() {
-        const cycles = [];
-        const visited = new Set();
-        const rec_stack = new Set();
-        const dfs = (name, path) => {
-            visited.add(name);
-            rec_stack.add(name);
-            path.push(name);
-            const node = this.nodes.get(name);
-            if (node) {
-                for (const [dep_name] of node.dependencies) {
-                    if (this.nodes.has(dep_name)) {
-                        if (!visited.has(dep_name)) {
-                            dfs(dep_name, [...path]);
-                        }
-                        else if (rec_stack.has(dep_name)) {
-                            // Found a cycle
-                            const cycle_start = path.indexOf(dep_name);
-                            cycles.push(path.slice(cycle_start).concat(dep_name));
-                        }
-                    }
-                }
-            }
-            rec_stack.delete(name);
-        };
-        for (const name of this.nodes.keys()) {
-            if (!visited.has(name)) {
-                dfs(name, []);
-            }
+                    return false;
+                return this.nodes.has(dep_name);
+            })
+                .map(([dep_name]) => dep_name),
+        }));
+        const result = topological_sort_generic(items, 'package');
+        if (!result.ok) {
+            throw new Error(result.error);
         }
-        return cycles;
+        return result.sorted.map((item) => item.id);
     }
     /**
      * Detects circular dependencies, categorized by severity.
@@ -190,87 +116,48 @@ export class DependencyGraph {
      * @returns object with production_cycles (errors) and dev_cycles (info)
      */
     detect_cycles_by_type() {
-        const production_cycles = [];
-        const dev_cycles = [];
-        const visited_prod = new Set();
-        const visited_dev = new Set();
-        const rec_stack_prod = new Set();
-        const rec_stack_dev = new Set();
-        // DFS for production/peer dependencies only
-        const dfs_prod = (name, path) => {
-            visited_prod.add(name);
-            rec_stack_prod.add(name);
-            path.push(name);
-            const node = this.nodes.get(name);
-            if (node) {
-                for (const [dep_name, spec] of node.dependencies) {
-                    // Skip dev dependencies
-                    if (spec.type === DEPENDENCY_TYPE.DEV)
-                        continue;
-                    if (this.nodes.has(dep_name)) {
-                        if (!visited_prod.has(dep_name)) {
-                            dfs_prod(dep_name, [...path]);
-                        }
-                        else if (rec_stack_prod.has(dep_name)) {
-                            // Found a production cycle
-                            const cycle_start = path.indexOf(dep_name);
-                            const cycle = path.slice(cycle_start).concat(dep_name);
-                            // Check if this cycle is unique
-                            const cycle_key = [...cycle].sort().join(',');
-                            const exists = production_cycles.some((c) => [...c].sort().join(',') === cycle_key);
-                            if (!exists) {
-                                production_cycles.push(cycle);
-                            }
-                        }
-                    }
-                }
-            }
-            rec_stack_prod.delete(name);
-        };
-        // DFS for dev dependencies only
-        const dfs_dev = (name, path) => {
-            visited_dev.add(name);
-            rec_stack_dev.add(name);
+        const production_cycles = this.#find_cycles((spec) => spec.type !== DEPENDENCY_TYPE.DEV);
+        const dev_cycles = this.#find_cycles((spec) => spec.type === DEPENDENCY_TYPE.DEV);
+        return { production_cycles, dev_cycles };
+    }
+    /** DFS cycle detection following only edges that match the filter. */
+    #find_cycles(include) {
+        const cycles = [];
+        const visited = new Set();
+        const rec_stack = new Set();
+        const dfs = (name, path) => {
+            visited.add(name);
+            rec_stack.add(name);
             path.push(name);
             const node = this.nodes.get(name);
             if (node) {
                 for (const [dep_name, spec] of node.dependencies) {
-                    // Only check dev dependencies
-                    if (spec.type !== DEPENDENCY_TYPE.DEV)
+                    if (!include(spec))
                         continue;
                     if (this.nodes.has(dep_name)) {
-                        if (!visited_dev.has(dep_name)) {
-                            dfs_dev(dep_name, [...path]);
+                        if (!visited.has(dep_name)) {
+                            dfs(dep_name, [...path]);
                         }
-                        else if (rec_stack_dev.has(dep_name)) {
-                            // Found a dev cycle
+                        else if (rec_stack.has(dep_name)) {
                             const cycle_start = path.indexOf(dep_name);
                             const cycle = path.slice(cycle_start).concat(dep_name);
-                            // Check if this cycle is unique
                             const cycle_key = [...cycle].sort().join(',');
-                            const exists = dev_cycles.some((c) => [...c].sort().join(',') === cycle_key);
+                            const exists = cycles.some((c) => [...c].sort().join(',') === cycle_key);
                             if (!exists) {
-                                dev_cycles.push(cycle);
+                                cycles.push(cycle);
                             }
                         }
                     }
                 }
             }
-            rec_stack_dev.delete(name);
+            rec_stack.delete(name);
         };
-        // Check for production/peer cycles
-        for (const name of this.nodes.keys()) {
-            if (!visited_prod.has(name)) {
-                dfs_prod(name, []);
-            }
-        }
-        // Check for dev cycles
         for (const name of this.nodes.keys()) {
-            if (!visited_dev.has(name)) {
-                dfs_dev(name, []);
+            if (!visited.has(name)) {
+                dfs(name, []);
             }
         }
-        return { production_cycles, dev_cycles };
+        return cycles;
     }
     toJSON() {
         const nodes = Array.from(this.nodes.values()).map((node) => ({

package/dist/semver.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"semver.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/semver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;AAEnD,MAAM,WAAW,MAAM;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;CACf;AAiGD;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM,KAAG,MAqB9D,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,mBAAmB,GAAI,SAAS,MAAM,EAAE,MAAM,QAAQ,KAAG,MAuBrE,CAAC"}
+{"version":3,"file":"semver.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/semver.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AAEH,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;AAEnD,MAAM,WAAW,MAAM;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;CACf;AAiGD;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM,KAAG,MAqB9D,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,mBAAmB,GAAI,SAAS,MAAM,EAAE,MAAM,QAAQ,KAAG,MAuBrE,CAAC"}

package/dist/semver.js

@@ -1,9 +1,4 @@
-/**
- * Semantic Versioning 2.0.0 utilities
- * @see https://semver.org/
- *
- * @module
- */
+// TODO: candidate for extraction to `@fuzdev/fuz_util`
 /**
  * SemVer 2.0.0 validation regex.
  * @see https://semver.org/#is-there-a-suggested-regular-expression-regex-to-check-a-semver-string

package/dist/version_utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"version_utils.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/version_utils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,aAAa,CAAC;AAE1C,eAAO,MAAM,WAAW,GAAI,SAAS,MAAM,KAAG,OAE7C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,GAAI,SAAS,MAAM,KAAG,MAEtD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,SAAS,MAAM,KAAG,MAGpD,CAAC;AAEF;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,gCAAgC,GAAI,SAAS,MAAM,KAAG,MAWlE,CAAC;AAEF,eAAO,MAAM,YAAY,GAAI,SAAS,MAAM,EAAE,aAAa,MAAM,KAAG,OASnE,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,iBAAiB,GAC7B,iBAAiB,MAAM,EACvB,mBAAkB,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,IAAU,KAC3C,MAcF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,GAC9B,aAAa,MAAM,EACnB,WAAW,OAAO,GAAG,OAAO,GAAG,OAAO,KACpC,OAWF,CAAC;AAEF,eAAO,MAAM,gBAAgB,GAC5B,aAAa,MAAM,EACnB,aAAa,MAAM,KACjB,OAAO,GAAG,OAAO,GAAG,OAOtB,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,GAAG,QAAQ,EAAE,GAAG,QAAQ,KAAG,MAO7D,CAAC;AAEF,eAAO,MAAM,sBAAsB,GAAI,iBAAiB,MAAM,EAAE,WAAW,QAAQ,KAAG,MAkBrF,CAAC"}
+{"version":3,"file":"version_utils.d.ts","sourceRoot":"../src/lib/","sources":["../src/lib/version_utils.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,aAAa,CAAC;AAE1C,eAAO,MAAM,WAAW,GAAI,SAAS,MAAM,KAAG,OAE7C,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,oBAAoB,GAAI,SAAS,MAAM,KAAG,MAEtD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,SAAS,MAAM,KAAG,MAGpD,CAAC;AAEF;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,gCAAgC,GAAI,SAAS,MAAM,KAAG,MAWlE,CAAC;AAEF,eAAO,MAAM,YAAY,GAAI,SAAS,MAAM,EAAE,aAAa,MAAM,KAAG,OASnE,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,iBAAiB,GAC7B,iBAAiB,MAAM,EACvB,mBAAkB,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,IAAU,KAC3C,MAcF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,GAC9B,aAAa,MAAM,EACnB,WAAW,OAAO,GAAG,OAAO,GAAG,OAAO,KACpC,OAWF,CAAC;AAEF,eAAO,MAAM,gBAAgB,GAC5B,aAAa,MAAM,EACnB,aAAa,MAAM,KACjB,OAAO,GAAG,OAAO,GAAG,OAOtB,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,GAAG,QAAQ,EAAE,GAAG,QAAQ,KAAG,MAO7D,CAAC;AAEF,eAAO,MAAM,sBAAsB,GAAI,iBAAiB,MAAM,EAAE,WAAW,QAAQ,KAAG,MAkBrF,CAAC"}

package/dist/version_utils.js

@@ -1,3 +1,4 @@
+// TODO: candidate for extraction to `@fuzdev/fuz_util`
 export const is_wildcard = (version) => {
     return version === '*';
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fuzdev/fuz_gitops",
-  "version": "0.65.1",
+  "version": "0.65.2",
   "description": "a tool for managing many repos",
   "glyph": "🪄",
   "logo": "logo.svg",
@@ -32,18 +32,18 @@
     "@fuzdev/fuz_css": ">=0.44.1",
     "@fuzdev/fuz_ui": ">=0.179.0",
     "@fuzdev/fuz_util": ">=0.45.3",
-    "@fuzdev/gro": "^0.192.1",
+    "@fuzdev/gro": "^0.194.0",
     "@sveltejs/kit": "^2",
     "svelte": "^5",
     "zod": "^4.1.13"
   },
   "devDependencies": {
     "@changesets/changelog-git": "^0.2.1",
-    "@fuzdev/fuz_code": "^0.45.0",
+    "@fuzdev/fuz_code": "^0.45.1",
     "@fuzdev/fuz_css": "^0.50.0",
-    "@fuzdev/fuz_ui": "^0.183.1",
+    "@fuzdev/fuz_ui": "^0.183.2",
     "@fuzdev/fuz_util": "^0.50.1",
-    "@fuzdev/gro": "^0.192.1",
+    "@fuzdev/gro": "^0.194.0",
     "@jridgewell/trace-mapping": "^0.3.31",
     "@ryanatkn/eslint-config": "^0.9.0",
     "@sveltejs/adapter-static": "^3.0.10",

package/src/lib/dependency_graph.ts

@@ -1,14 +1,17 @@
 /**
  * Dependency graph data structure and algorithms for multi-repo publishing.
  *
- * Provides `DependencyGraph` class with topological sort and cycle detection.
+ * Provides `DependencyGraph` class with topological sort (via `@fuzdev/fuz_util/sort.js`)
+ * and cycle detection by dependency type.
  * For validation workflow and publishing order computation, see `graph_validation.ts`.
  *
  * @module
  */
 
-import type {LocalRepo} from './local_repo.js';
 import {EMPTY_OBJECT} from '@fuzdev/fuz_util/object.js';
+import {topological_sort as topological_sort_generic} from '@fuzdev/fuz_util/sort.js';
+
+import type {LocalRepo} from './local_repo.js';
 
 export const DEPENDENCY_TYPE = {
 	PROD: 'prod',
@@ -121,8 +124,8 @@ export class DependencyGraph {
 	/**
 	 * Computes topological sort order for dependency graph.
 	 *
-	 * Uses Kahn's algorithm with alphabetical ordering within tiers for
-	 * deterministic results. Throws if cycles detected.
+	 * Delegates to `@fuzdev/fuz_util/sort.js` for the sorting algorithm.
+	 * Throws if cycles detected.
 	 *
 	 * @param exclude_dev if true, excludes dev dependencies to break cycles.
 	 *   Publishing uses exclude_dev=true to handle circular dev deps.
@@ -130,111 +133,20 @@ export class DependencyGraph {
 	 * @throws {Error} if circular dependencies detected in included dependency types
 	 */
 	topological_sort(exclude_dev = false): Array<string> {
-		const visited: Set<string> = new Set();
-		const result: Array<string> = [];
-
-		// Count incoming edges for each node
-		const in_degree: Map<string, number> = new Map();
-		for (const name of this.nodes.keys()) {
-			in_degree.set(name, 0);
-		}
-		for (const node of this.nodes.values()) {
-			for (const [dep_name, spec] of node.dependencies) {
-				// Skip dev dependencies if requested
-				if (exclude_dev && spec.type === DEPENDENCY_TYPE.DEV) continue;
-
-				if (this.nodes.has(dep_name)) {
-					in_degree.set(node.name, in_degree.get(node.name)! + 1);
-				}
-			}
-		}
-
-		// Start with nodes that have no dependencies
-		const queue: Array<string> = [];
-		for (const [name, degree] of in_degree) {
-			if (degree === 0) {
-				queue.push(name);
-			}
-		}
-
-		// Sort initial queue alphabetically for deterministic ordering within tier
-		queue.sort();
-
-		// Process nodes
-		while (queue.length > 0) {
-			const name = queue.shift()!;
-			result.push(name);
-			visited.add(name);
-
-			// Reduce in-degree for dependents
-			const node = this.nodes.get(name);
-			if (node) {
-				// Find packages that depend on this one
-				// Sort nodes to ensure deterministic iteration order
-				const sorted_nodes = Array.from(this.nodes.values()).sort((a, b) =>
-					a.name.localeCompare(b.name),
-				);
-				for (const other_node of sorted_nodes) {
-					for (const [dep_name, spec] of other_node.dependencies) {
-						// Skip dev dependencies if requested
-						if (exclude_dev && spec.type === DEPENDENCY_TYPE.DEV) continue;
-
-						if (dep_name === name) {
-							const new_degree = in_degree.get(other_node.name)! - 1;
-							in_degree.set(other_node.name, new_degree);
-							if (new_degree === 0) {
-								queue.push(other_node.name);
-							}
-						}
-					}
-				}
-			}
-		}
-
-		// Check for cycles
-		if (result.length !== this.nodes.size) {
-			const unvisited = Array.from(this.nodes.keys()).filter((n) => !visited.has(n));
-			throw new Error(`Circular dependency detected involving: ${unvisited.join(', ')}`);
-		}
-
-		return result;
-	}
-
-	detect_cycles(): Array<Array<string>> {
-		const cycles: Array<Array<string>> = [];
-		const visited: Set<string> = new Set();
-		const rec_stack: Set<string> = new Set();
-
-		const dfs = (name: string, path: Array<string>): void => {
-			visited.add(name);
-			rec_stack.add(name);
-			path.push(name);
-
-			const node = this.nodes.get(name);
-			if (node) {
-				for (const [dep_name] of node.dependencies) {
-					if (this.nodes.has(dep_name)) {
-						if (!visited.has(dep_name)) {
-							dfs(dep_name, [...path]);
-						} else if (rec_stack.has(dep_name)) {
-							// Found a cycle
-							const cycle_start = path.indexOf(dep_name);
-							cycles.push(path.slice(cycle_start).concat(dep_name));
-						}
-					}
-				}
-			}
-
-			rec_stack.delete(name);
-		};
-
-		for (const name of this.nodes.keys()) {
-			if (!visited.has(name)) {
-				dfs(name, []);
-			}
+		const items = Array.from(this.nodes.values()).map((node) => ({
+			id: node.name,
+			depends_on: Array.from(node.dependencies.entries())
+				.filter(([dep_name, spec]) => {
+					if (exclude_dev && spec.type === DEPENDENCY_TYPE.DEV) return false;
+					return this.nodes.has(dep_name);
+				})
+				.map(([dep_name]) => dep_name),
+		}));
+		const result = topological_sort_generic(items, 'package');
+		if (!result.ok) {
+			throw new Error(result.error);
 		}
-
-		return cycles;
+		return result.sorted.map((item) => item.id);
 	}
 
 	/**
@@ -252,94 +164,53 @@ export class DependencyGraph {
 		production_cycles: Array<Array<string>>;
 		dev_cycles: Array<Array<string>>;
 	} {
-		const production_cycles: Array<Array<string>> = [];
-		const dev_cycles: Array<Array<string>> = [];
-		const visited_prod: Set<string> = new Set();
-		const visited_dev: Set<string> = new Set();
-		const rec_stack_prod: Set<string> = new Set();
-		const rec_stack_dev: Set<string> = new Set();
-
-		// DFS for production/peer dependencies only
-		const dfs_prod = (name: string, path: Array<string>): void => {
-			visited_prod.add(name);
-			rec_stack_prod.add(name);
-			path.push(name);
-
-			const node = this.nodes.get(name);
-			if (node) {
-				for (const [dep_name, spec] of node.dependencies) {
-					// Skip dev dependencies
-					if (spec.type === DEPENDENCY_TYPE.DEV) continue;
-
-					if (this.nodes.has(dep_name)) {
-						if (!visited_prod.has(dep_name)) {
-							dfs_prod(dep_name, [...path]);
-						} else if (rec_stack_prod.has(dep_name)) {
-							// Found a production cycle
-							const cycle_start = path.indexOf(dep_name);
-							const cycle = path.slice(cycle_start).concat(dep_name);
-							// Check if this cycle is unique
-							const cycle_key = [...cycle].sort().join(',');
-							const exists = production_cycles.some((c) => [...c].sort().join(',') === cycle_key);
-							if (!exists) {
-								production_cycles.push(cycle);
-							}
-						}
-					}
-				}
-			}
+		const production_cycles = this.#find_cycles((spec) => spec.type !== DEPENDENCY_TYPE.DEV);
+		const dev_cycles = this.#find_cycles((spec) => spec.type === DEPENDENCY_TYPE.DEV);
+		return {production_cycles, dev_cycles};
+	}
 
-			rec_stack_prod.delete(name);
-		};
+	/** DFS cycle detection following only edges that match the filter. */
+	#find_cycles(include: (spec: DependencySpec) => boolean): Array<Array<string>> {
+		const cycles: Array<Array<string>> = [];
+		const visited: Set<string> = new Set();
+		const rec_stack: Set<string> = new Set();
 
-		// DFS for dev dependencies only
-		const dfs_dev = (name: string, path: Array<string>): void => {
-			visited_dev.add(name);
-			rec_stack_dev.add(name);
+		const dfs = (name: string, path: Array<string>): void => {
+			visited.add(name);
+			rec_stack.add(name);
 			path.push(name);
 
 			const node = this.nodes.get(name);
 			if (node) {
 				for (const [dep_name, spec] of node.dependencies) {
-					// Only check dev dependencies
-					if (spec.type !== DEPENDENCY_TYPE.DEV) continue;
+					if (!include(spec)) continue;
 
 					if (this.nodes.has(dep_name)) {
-						if (!visited_dev.has(dep_name)) {
-							dfs_dev(dep_name, [...path]);
-						} else if (rec_stack_dev.has(dep_name)) {
-							// Found a dev cycle
+						if (!visited.has(dep_name)) {
+							dfs(dep_name, [...path]);
+						} else if (rec_stack.has(dep_name)) {
 							const cycle_start = path.indexOf(dep_name);
 							const cycle = path.slice(cycle_start).concat(dep_name);
-							// Check if this cycle is unique
 							const cycle_key = [...cycle].sort().join(',');
-							const exists = dev_cycles.some((c) => [...c].sort().join(',') === cycle_key);
+							const exists = cycles.some((c) => [...c].sort().join(',') === cycle_key);
 							if (!exists) {
-								dev_cycles.push(cycle);
+								cycles.push(cycle);
 							}
 						}
 					}
 				}
 			}
 
-			rec_stack_dev.delete(name);
+			rec_stack.delete(name);
 		};
 
-		// Check for production/peer cycles
-		for (const name of this.nodes.keys()) {
-			if (!visited_prod.has(name)) {
-				dfs_prod(name, []);
-			}
-		}
-
-		// Check for dev cycles
 		for (const name of this.nodes.keys()) {
-			if (!visited_dev.has(name)) {
-				dfs_dev(name, []);
+			if (!visited.has(name)) {
+				dfs(name, []);
 			}
 		}
 
-		return {production_cycles, dev_cycles};
+		return cycles;
 	}
 
 	toJSON(): DependencyGraphJson {

package/src/lib/semver.ts

@@ -1,3 +1,5 @@
+// TODO: candidate for extraction to `@fuzdev/fuz_util`
+
 /**
  * Semantic Versioning 2.0.0 utilities
  * @see https://semver.org/

package/src/lib/version_utils.ts

@@ -1,3 +1,5 @@
+// TODO: candidate for extraction to `@fuzdev/fuz_util`
+
 import type {BumpType} from './semver.js';
 
 export const is_wildcard = (version: string): boolean => {