Skip to content
DRAFT

Basic Flow Chart in Mermaid

Mine

graph LR
A(Does it move) --> B(Yes);
A(Does it move) --> C(No);
B(Yes) --> D(Should it?);
C(No) --> E(Should it?);
D(Should it?) --> D1(Yes);
D(Should it?) --> D2(No);
E(Should it?) --> E1(Yes);
E(Should it?) --> E2(No);
D1(Yes) --> D3(No problem);
D2(No) --> D4(Duct Tape);
E1(Yes) --> E3(WD-40);
E2(No) --> E4(No problem);
graph LR
A(Does it move) --> B(Yes);
A(Does it move) --> C(No);
B(Yes) --> D(Should it?);
C(No) --> E(Should it?);
D(Should it?) --> D1(Yes);
D(Should it?) --> D2(No);
E(Should it?) --> E1(Yes);
E(Should it?) --> E2(No);
D1(Yes) --> D3(No problem);
D2(No) --> D4(Duct Tape);
E1(Yes) --> E3(WD-40);
E2(No) --> E4(No problem);

seperator

Grok Cleaned

graph TD
    A[Does it move?] -->|Yes| B[Should it move?]
    A -->|No| C[Should it move?]

    B -->|Yes| D[No problem]
    B -->|No| E[Use duct tape]

    C -->|Yes| F[Use WD-40]
    C -->|No| G[No problem]

```mermaid
graph TD
    A[Does it move?] -->|Yes| B[Should it move?]
    A -->|No| C[Should it move?]

    B -->|Yes| D[No problem]
    B -->|No| E[Use duct tape]

    C -->|Yes| F[Use WD-40]
    C -->|No| G[No problem]

```