Open the context
Choose the project folder and name the files or behavior involved.
Workflows
Coding workflows · Algorithm reasoning
03
A concrete starting point
Check a graph traversal for cycles. Distinguish active nodes from visited ones and test a self-loop, a disconnected component and an acyclic path.
Define the change
Describe the input, expected output and boundaries that must stay intact.
Inspect the work
Review the proposed edits and any commands before relying on their result.
Check the outcome
Compare actual behavior with the expected result. If a check fails, investigate it before applying more changes.
Algorithm reasoning
A concrete starting point
if (active.has(node)) return cycleFound();
if (visited.has(node)) return;
active.add(node);
for (const child of edges(node)) visit(child);The example is a starting point for a real project, not a claim that generated code is already tested. Adjust paths, dependencies and expected behavior to match your application.