diff --git a/CHANGELOG.md b/CHANGELOG.md
index 17f7c20..ec5c230 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
- [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
- [`auto-changelog`](https://github.com/CookPete/auto-changelog)
-## [v1.45.2](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
+## [v1.45.3](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
### Changes
diff --git a/README.md b/README.md
index 5458473..e49afe2 100644
--- a/README.md
+++ b/README.md
@@ -71,46 +71,96 @@ const {
} = dataStructureTyped;
```
-#### Binary Tree
+## Software Engineering Design Standards
+
+
+ Principle |
+ Description |
+
+
+ Practicality |
+ Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names. |
+
+
+ Extensibility |
+ Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures. |
+
+
+ Modularization |
+ Includes data structure modularization and independent NPM packages. |
+
+
+ Efficiency |
+ All methods provide time and space complexity, comparable to native JS performance. |
+
+
+ Maintainability |
+ Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns. |
+
+
+ Testability |
+ Automated and customized unit testing, performance testing, and integration testing. |
+
+
+ Portability |
+ Plans for porting to Java, Python, and C++, currently achieved to 80%. |
+
+
+ Reusability |
+ Fully decoupled, minimized side effects, and adheres to OOP. |
+
+
+ Security |
+ Carefully designed security for member variables and methods. Data structure software does not need to consider other security aspects. |
+
+
+ Scalability |
+ Data structure software does not involve load issues. |
+
+
+
+## Vivid Examples
+
+### Binary Tree
[Try it out](https://vivid-algorithm.vercel.app/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/binary-tree-array-to-binary-tree.webp)
-#### Binary Tree DFS
+### Binary Tree DFS
[Try it out](https://vivid-algorithm.vercel.app/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/binary-tree-dfs-in-order.webp)
-#### AVL Tree
+### AVL Tree
[Try it out](https://vivid-algorithm.vercel.app/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/avl-tree-test.webp)
-#### Tree Multi Map
+### Tree Multi Map
[Try it out](https://vivid-algorithm.vercel.app/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/tree-multiset-test.webp)
-#### Matrix
+### Matrix
[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/matrix-cut-off-tree-for-golf.webp)
-#### Directed Graph
+### Directed Graph
[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/directed-graph-test.webp)
-#### Map Graph
+### Map Graph
[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/), or you can execute your own code using our [visual tool](https://github.com/zrwusa/vivid-algorithm)
![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/map-graph-test.webp)
@@ -568,7 +618,7 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', '
-### Standard library data structure comparison
+## Standard library data structure comparison