euler_path
Checks whether a graph contains an Eulerian path or circuit, reporting degree analysis and start/end vertices.
Instructions
Check whether a graph has an Eulerian path or circuit. Reports degree analysis and start/end vertices.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"vertices": "<vertices>",
"edges": "<edges>"
},
"name": "euler_path"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Edges as [u, v] pairs | |
| directed | No | Whether the graph is directed (default: false) | |
| vertices | Yes | Number of vertices (0-indexed) |