algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-07-05 08:26:14 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update Graph image.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2022-08-11 16:34:05 +02:00
parent 3d2cfb99b7
commit ac31c913b2
6 changed files with 35 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/data-structures/graph/README.fr-FR.md
View File

@ -16,7 +16,9 @@ dans le cas orienté. Les sommets peuvent faire partie
de la structure, ou être des entités extérieures, de la structure, ou être des entités extérieures,
représentées par des entiers ou des références. représentées par des entiers ou des références.
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg) ![Graph](./images/graph.jpeg)
*Made with [okso.app](https://okso.app)*
## References ## References

4
src/data-structures/graph/README.md
View File

@ -22,7 +22,9 @@ for a directed graph. The vertices may be part of
the graph structure, or may be external entities the graph structure, or may be external entities
represented by integer indices or references. represented by integer indices or references.
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg) ![Graph](./images/graph.jpeg)
*Made with [okso.app](https://okso.app)*
## References ## References

4
src/data-structures/graph/README.pt-BR.md
View File

@ -17,7 +17,9 @@ para um grafo direcionado.
Os vértices podem fazer parte a estrutura do grafo, ou podem Os vértices podem fazer parte a estrutura do grafo, ou podem
ser entidades externas representadas por índices inteiros ou referências. ser entidades externas representadas por índices inteiros ou referências.
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg) ![Graph](./images/graph.jpeg)
*Made with [okso.app](https://okso.app)*
## Referências ## Referências

4
src/data-structures/graph/README.ru-RU.md
View File

@ -14,7 +14,9 @@
информатике, могут быть представлены графами. Например, строение Википедии можно смоделировать при помощи информатике, могут быть представлены графами. Например, строение Википедии можно смоделировать при помощи
ориентированного графа, в котором вершины — это статьи, а дуги (ориентированные рёбра) — гиперссылки. ориентированного графа, в котором вершины — это статьи, а дуги (ориентированные рёбра) — гиперссылки.
![Граф](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg) ![Граф](./images/graph.jpeg)
*Made with [okso.app](https://okso.app)*
## Ссылки ## Ссылки

4
src/data-structures/graph/README.zh-CN.md
View File

@ -11,9 +11,9 @@
如果顶点对之间的边是有权重的,该图可称为加权图。 如果顶点对之间的边是有权重的,该图可称为加权图。
![Graph](./images/graph.jpeg)
*Made with [okso.app](https://okso.app)*
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
## 参考 ## 参考

BIN
src/data-structures/graph/images/graph.jpeg Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 132 KiB