Analyze
analyzeRun all graph checks at once and return a summary. Prioritizes quick checks, skips irrelevant ones with reasons, and answers open-ended graph questions.
Instructions
Run every check at once and return one summary of the graph.
Cheap checks first; checks that do not apply are skipped with a reason (b-invariance needs a brick, for instance). Prefer this for open-ended questions such as "what can you tell me about this graph?" or "is this a near-bipartite essentially-4-edge-connected cubic brick?".
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": {
"graph": "<graph>"
},
"name": "analyze"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| kmax | No | largest cyclic cut size to search for. | |
| graph | Yes | a graph6 string or a registry name. | |
| max_order | No | vertex-count ceiling for the exhaustive cyclic-cut search. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||