Model a problem as nodes and relationships. Use it when linear lists hide dependencies.
Goal
- Identify important nodes.
- Name relationships.
- Find clusters, bottlenecks, loops, and paths.
- Turn structure into decisions.
Concepts
- Node: item, person, system, idea, or constraint.
- Edge: relationship between nodes.
- Cluster: tightly connected group.
- Path: route through graph.
- Centrality: importance by connectedness.
- Loop: circular dependency or feedback.
Edge types
- Dependency: A requires B.
- Influence: A affects B.
- Conflict: A competes with B.
- Synergy: A improves B.
- Flow: A sends value, data, or work to B.
Rules
- Do not connect everything to everything.
- Name edge types.
- Mark edge strength when useful.
- Look for missing nodes.
- Look for critical paths.
- Prefer simple diagrams over dense tables.
Flow
- Define subject and decision to support.
- List nodes.
- Group nodes by category.
- Add typed edges.
- Identify central nodes, clusters, loops, and bottlenecks.
- Trace key paths.
- Recommend actions.
Resources
- Graph of Thoughts: ArXiv Paper
- Neo4j Graph Database Use Cases
- Network Science by Albert-László Barabási
Output
## Graph Analysis
Subject: [what is being mapped]
## Nodes
- [category]: [nodes]
## Relationships
- [A] -> [B]: [edge type], [strength]
## Patterns
- Central nodes: [nodes]
- Clusters: [groups]
- Bottlenecks: [nodes]
- Loops: [loops or none]
- Critical paths: [paths]
## Recommendations
- [action]
- [action]