dfs_search
Traverse a graph depth-first from a start node to find a path, return visit order and reachable count, and detect cycles.
Instructions
Depth-first search on a graph. Finds a path, visit order, reachable count, and detects cycles.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Array of edges | |
| start | Yes | Start node | |
| target | No | Optional target node | |
| directed | No | Whether the graph is directed (default true) |