Connection
Base URL, credentials and a reachable server.
Product
Product features · Algorithm reasoning
01
Check a graph traversal for cycles. Distinguish active nodes from visited ones and test a self-loop, a disconnected component and an acyclic path.
Selection
A model available through the configured endpoint.
Capabilities
Context limits and tool support are determined by the model and server.
Algorithm reasoning
● ● ●CogitoDesk●
A concrete starting point · Algorithm reasoning ×
if (active.has(node)) return cycleFound();
if (visited.has(node)) return;
active.add(node);
for (const child of edges(node)) visit(child);✳Check a graph traversal for cycles.
✓ ChangesReview before applying ↗
Illustrative workspace