analyze_graph
Compute PageRank centrality, Louvain communities, critical paths, and bottlenecks in directed graphs to identify influential nodes, clusters, and chokepoints.
Instructions
[Premium] Compute structural properties of a directed graph: PageRank centrality, Louvain community detection, shortest critical path between two nodes, and bottleneck identification. Use to surface influential nodes, community clusters, or chokepoints in dependency graphs, knowledge graphs, supply chains, social networks. For pathfinding alone (single source→goal route), use plan_pathfind — it's faster and free. Requires ORACLAW_API_KEY.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| nodes | Yes | ||
| edges | Yes | ||
| sourceGoal | No | Optional: node ID to use as start of critical path. | |
| targetGoal | No | Optional: node ID to use as end of critical path. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| pageRank | Yes | Node ID → PageRank score. | |
| communities | Yes | Node ID → community index. | |
| clusters | No | ||
| criticalPath | No | Node IDs from sourceGoal to targetGoal. | |
| criticalPathWeight | No | ||
| bottlenecks | No | Nodes whose removal most disconnects the graph. | |
| totalNodes | Yes |