graph_operation
Create graphs from named examples or adjacency lists and compute key properties like chromatic number, connectivity, diameter, and shortest paths.
Instructions
Graph theory: create named graphs and compute properties (chromatic_number, is_connected, diameter, etc.)
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| graph | Yes | Graph constructor: a named graph like 'PetersenGraph' or an adjacency dict like '{0:[1,2], 1:[0,2], 2:[0,1]}' | |
| source | No | Source vertex | |
| target | No | Target vertex | |
| operation | Yes | One of: chromatic_number, is_connected, is_planar, diameter, order, size, degree_sequence, adjacency_matrix, shortest_path (requires source and target) |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||