Mermaid Mindmaps

calendar Dec 12, 2024 · 2 min read · mermaid mindmap brainstorming diagram visualization diagrams  ·
Share on: linkedin copy

Mindmaps visualize hierarchical information in a radial tree structure. Perfect for brainstorming, organizing ideas, and showing relationships between concepts.

Use Case

Use mindmaps when you need to:

  • Brainstorm ideas
  • Organize information hierarchically
  • Show concept relationships
  • Create knowledge maps
  • Visualize topic breakdowns

Code

1```mermaid
2mindmap
3  root((Root))
4    Branch A
5      Leaf A1
6      Leaf A2
7    Branch B
8      Leaf B1
9```

Result:

mindmap
  root((Root))
    Branch A
      Leaf A1
      Leaf A2
    Branch B
      Leaf B1

Explanation

  • mindmap - Start mindmap diagram
  • ((text)) - Root node (double parentheses)
  • Indentation creates hierarchy
  • Each level is a child of the previous

Examples

Example 1: Project Planning

 1```mermaid
 2mindmap
 3  root((Project Plan))
 4    Research
 5      Literature Review
 6      Market Analysis
 7      Competitor Study
 8    Design
 9      Architecture
10      UI/UX
11      Database
12    Development
13      Backend
14      Frontend
15      Testing
16    Deployment
17      Staging
18      Production
19      Monitoring
20```

Result:

mindmap
  root((Project Plan))
    Research
      Literature Review
      Market Analysis
      Competitor Study
    Design
      Architecture
      UI/UX
      Database
    Development
      Backend
      Frontend
      Testing
    Deployment
      Staging
      Production
      Monitoring

Example 2: Learning Path

 1```mermaid
 2mindmap
 3  root((Machine Learning))
 4    Supervised Learning
 5      Classification
 6        Logistic Regression
 7        Decision Trees
 8        Neural Networks
 9      Regression
10        Linear Regression
11        Polynomial Regression
12    Unsupervised Learning
13      Clustering
14        K-Means
15        Hierarchical
16      Dimensionality Reduction
17        PCA
18        t-SNE
19    Reinforcement Learning
20      Q-Learning
21      Policy Gradients
22```

Result:

mindmap
  root((Machine Learning))
    Supervised Learning
      Classification
        Logistic Regression
        Decision Trees
        Neural Networks
      Regression
        Linear Regression
        Polynomial Regression
    Unsupervised Learning
      Clustering
        K-Means
        Hierarchical
      Dimensionality Reduction
        PCA
        t-SNE
    Reinforcement Learning
      Q-Learning
      Policy Gradients

Notes

  • Root node uses double parentheses: ((Root))
  • Indentation determines hierarchy (2 spaces per level)
  • Keep node names concise
  • Can nest multiple levels deep

Gotchas/Warnings

  • ⚠️ Indentation: Must be consistent (spaces, not tabs)
  • ⚠️ Root Node: Must use double parentheses
  • ⚠️ Depth: Very deep hierarchies can be hard to read
  • ⚠️ Node Names: Keep short for better visualization

Related Snippets