images cropped
25
README.md
|
@ -204,33 +204,32 @@ Binary Tree, Binary Search Tree (BST), AVL Tree, Tree Multiset, Segment Tree, Bi
|
|||
|
||||
![](src/data-structures/binary-tree/diagrams/avl-tree-inserting.gif)
|
||||
|
||||
![](src/data-structures/binary-tree/diagrams/segment-tree.png)
|
||||
|
||||
![](src/data-structures/graph/diagrams/tarjan.webp)
|
||||
|
||||
![](src/data-structures/graph/diagrams/adjacency-list.png)
|
||||
![](src/data-structures/graph/diagrams/adjacency-list.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/adjacency-list-pros-cons.png)
|
||||
![](src/data-structures/graph/diagrams/adjacency-list-pros-cons.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/adjacency-matrix.png)
|
||||
![](src/data-structures/graph/diagrams/adjacency-matrix.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/adjacency-matrix-pros-cons.png)
|
||||
![](src/data-structures/graph/diagrams/adjacency-matrix-pros-cons.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/dfs-can-do.png)
|
||||
![](src/data-structures/graph/diagrams/dfs-can-do.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/edge-list.png)
|
||||
![](src/data-structures/graph/diagrams/edge-list.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/edge-list-pros-cons.png)
|
||||
![](src/data-structures/graph/diagrams/edge-list-pros-cons.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/max-flow.png)
|
||||
![](src/data-structures/graph/diagrams/max-flow.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/mst.png)
|
||||
![](src/data-structures/graph/diagrams/mst.jpg)
|
||||
|
||||
![](src/data-structures/graph/diagrams/tarjan-articulation-point-bridge.png)
|
||||
[//]: # (![](src/data-structures/graph/diagrams/tarjan-articulation-point-bridge.png))
|
||||
|
||||
![](src/data-structures/graph/diagrams/tarjan-complicate-simple.png)
|
||||
[//]: # (![](src/data-structures/graph/diagrams/tarjan-complicate-simple.png))
|
||||
|
||||
![](src/data-structures/graph/diagrams/tarjan-strongly-connected-component.png)
|
||||
[//]: # (![](src/data-structures/graph/diagrams/tarjan-strongly-connected-component.png))
|
||||
|
||||
|
||||
|
||||
|
|
BIN
src/data-structures/graph/diagrams/adjacency-list-pros-cons.jpg
Normal file
After Width: | Height: | Size: 319 KiB |
Before Width: | Height: | Size: 907 KiB |
BIN
src/data-structures/graph/diagrams/adjacency-list.jpg
Normal file
After Width: | Height: | Size: 283 KiB |
Before Width: | Height: | Size: 1.1 MiB |
After Width: | Height: | Size: 309 KiB |
Before Width: | Height: | Size: 921 KiB |
BIN
src/data-structures/graph/diagrams/adjacency-matrix.jpg
Normal file
After Width: | Height: | Size: 472 KiB |
Before Width: | Height: | Size: 1.7 MiB |
BIN
src/data-structures/graph/diagrams/dfs-can-do.jpg
Normal file
After Width: | Height: | Size: 398 KiB |
Before Width: | Height: | Size: 1.4 MiB |
BIN
src/data-structures/graph/diagrams/edge-list-pros-cons.jpg
Normal file
After Width: | Height: | Size: 287 KiB |
Before Width: | Height: | Size: 777 KiB |
BIN
src/data-structures/graph/diagrams/edge-list.jpg
Normal file
After Width: | Height: | Size: 496 KiB |
Before Width: | Height: | Size: 1.9 MiB |
BIN
src/data-structures/graph/diagrams/max-flow.jpg
Normal file
After Width: | Height: | Size: 558 KiB |
Before Width: | Height: | Size: 2 MiB |
BIN
src/data-structures/graph/diagrams/mst.jpg
Normal file
After Width: | Height: | Size: 470 KiB |
Before Width: | Height: | Size: 1.8 MiB |
Before Width: | Height: | Size: 3.1 MiB After Width: | Height: | Size: 2.1 MiB |