Examples

graph TD A{Does your flowchart have arrows?} --> B[No] A --> C[yes] B --> D(Add them already) C --> E(Yay, what a great flowchart!) D -.->|you can even add text to them| A

graph LR information["information"] -- "consumes" --> attention["attention of recipient"]

stateDiagram-v2 direction TB Programming_Basics --> Recursion Recursion --> Algorithm_Complexity Algorithm_Complexity --> Dynamic_Programming_Core_Concepts Dynamic_Programming_Core_Concepts --> Overlapping_Subproblems Dynamic_Programming_Core_Concepts --> Optimal_Substructure Overlapping_Subproblems --> Memoization Optimal_Substructure --> Tabulation Memoization --> Implementation_Details Tabulation --> Implementation_Details Implementation_Details --> State_Representation Implementation_Details --> Choice_Diagram State_Representation --> Initializing_Base_Conditions Choice_Diagram --> Initializing_Base_Conditions Initializing_Base_Conditions --> Knapsack_Problem_Statement Knapsack_Problem_Statement --> Knapsack_Required_Concepts Knapsack_Required_Concepts --> Dynamic_Programming_Core_Concepts Knapsack_Required_Concepts --> Specific_Strategies_for_Knapsack Specific_Strategies_for_Knapsack --> Defining_the_State Specific_Strategies_for_Knapsack --> Choice_Diagram_Implementation Defining_the_State --> Initializing_DP_Array Choice_Diagram_Implementation --> Initializing_DP_Array Initializing_DP_Array --> Problem_Variations state Dynamic_Programming_Core_Concepts { Overlapping_Subproblems Optimal_Substructure } state Implementation_Details { State_Representation Choice_Diagram Initializing_Base_Conditions } state Knapsack_Required_Concepts { Dynamic_Programming_Core_Concepts Specific_Strategies_for_Knapsack } state Specific_Strategies_for_Knapsack { Defining_the_State Choice_Diagram_Implementation Initializing_DP_Array } ```