Results for “cycle-detection”

Graph algorithms for detecting and resolving cycles in directed graphs and workflow definitions

The English summary is being prepared. Showing the original description.

Validates DAG structures, performs topological sorting, detects cycles, and resolves dependency conflicts. Uses Kahn's algorithm for optimal execution ordering. Activate on 'resolve dependencies', 'topological sort', 'cycle detection', 'dependency order', 'validate dag'. NOT for building DAGs (use dag-graph-builder) or scheduling execution (use dag-task-scheduler).

The English summary is being prepared. Showing the original description.

Analyze undirected cycle structure within a valid DAG using the source paper's orientation and contraction method. Use for cycle-basis analysis with explicit graph and reduction choices. NOT for directed feedback loops, workflow deadlocks, or runtime resilience claims.

The English summary is being prepared. Showing the original description.