update readme

README.md

@@ -87,9 +87,17 @@ Pocket Flow is also a *learning resource*, as current frameworks abstract too mu
 
 ## How Does it Work?
 
-The [100 lines](pocketflow/__init__.py) capture what we see as the core abstraction of most LLM frameworks: a **Nested Directed Graph** that breaks down tasks into multiple (LLM) steps, with branching and recursion for agent-like decision-making. From there, it’s easy to layer on more complex features.
+The [100 lines](pocketflow/__init__.py) capture what we see as the core abstraction of most LLM frameworks: **Nested Directed Graph** that breaks down tasks into multiple (LLM) steps, with branching and recursion for agent-like decision-making. 
 
+<div align="center">
+  <img src="./assets/abstraction.png" width="500"/>
+</div>
 
+From there, it’s easy to layer on more complex features.
+
+<div align="center">
+  <img src="./assets/paradigm.png" width="500"/>
+</div>
 
 - To learn more details, please check out documentation: https://the-pocket.github.io/PocketFlow/
 
@@ -99,6 +107,4 @@ The [100 lines](pocketflow/__init__.py) capture what we see as the core abstract
  
 - More coming soon ... Let us know you’d love to see!
 
-<div align="center">
-  <img src="./assets/graph.png" width="500"/>
-</div>
+

docs/guide.md

@@ -10,9 +10,30 @@ nav_order: 1
 {: .important }
 > Use LLMs to help with system design and implementation wherever possible.
 
+## Recommended LLM Project Structure:
+
+```
+my_project/
+├── utils/
+│   ├── __init__.py
+│   ├── call_llm.py
+│   └── search_web.py
+├── tests/
+│   ├── __init__.py
+│   ├── test_flow.py
+│   └── test_nodes.py
+├── main.py
+├── flow.py
+├── requirements.txt
+└── design.md
+```
+
+
+## System Design Steps:
+
 1. **Understand Requirements**  
-   - Clarify the app’s needs and workflow.  
-   - Determine data access (e.g., from files or databases).
+   - Clarify the app’s needs and requirements.  
+   - Determine data access (e.g., from files or databases). 
 
 2. **High-Level Flow Design**  
    - Represent the process as a *Nested Directed Graph*.