Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit ac31c91

Browse files
committed
Update Graph image.
1 parent 3d2cfb9 commit ac31c91

File tree

6 files changed

+35
-27
lines changed

6 files changed

+35
-27
lines changed
Lines changed: 12 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -1,23 +1,25 @@
11
# Graph
22

33
En informatique, un **graphe** est une structure de
4-
données abstraite qui implémente les concepts de
4+
données abstraite qui implémente les concepts de
55
graphe orienté et de graphe non-orienté venant
66
des mathématiques, plus précisément du domaine de
77
la théorie des graphes.
88

9-
La structure de données abstraite de graphe consiste
10-
en un ensemble fini, éventuellement mutable de sommets
11-
ou nœuds ou points, avec un ensemble de paires ordonnées
12-
ou non de tels éléments. Ces paires sont des arêtes, arcs
9+
La structure de données abstraite de graphe consiste
10+
en un ensemble fini, éventuellement mutable de sommets
11+
ou nœuds ou points, avec un ensemble de paires ordonnées
12+
ou non de tels éléments. Ces paires sont des arêtes, arcs
1313
non orientés, ou lignes pour un graphe non orienté, et
14-
flèches, arêtes orientées , arcs, ou lignes orientées
15-
dans le cas orienté. Les sommets peuvent faire partie
16-
de la structure, ou être des entités extérieures,
14+
flèches, arêtes orientées , arcs, ou lignes orientées
15+
dans le cas orienté. Les sommets peuvent faire partie
16+
de la structure, ou être des entités extérieures,
1717
représentées par des entiers ou des références.
1818

19-
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
19+
![Graph](./images/graph.jpeg)
20+
21+
*Made with [okso.app](https://okso.app)*
2022

2123
## References
2224

23-
- [Wikipedia](https://fr.wikipedia.org/wiki/Graphe_(type_abstrait))
25+
- [Wikipedia](https://fr.wikipedia.org/wiki/Graphe_(type_abstrait))

‎src/data-structures/graph/README.md‎

Lines changed: 14 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -6,23 +6,25 @@ _Read this in other languages:_
66
[_Français_](README.fr-FR.md),
77
[_Português_](README.pt-BR.md)
88

9-
In computer science, a **graph** is an abstract data type
10-
that is meant to implement the undirected graph and
9+
In computer science, a **graph** is an abstract data type
10+
that is meant to implement the undirected graph and
1111
directed graph concepts from mathematics, specifically
1212
the field of graph theory
1313

14-
A graph data structure consists of a finite (and possibly
15-
mutable) set of vertices or nodes or points, together
16-
with a set of unordered pairs of these vertices for an
17-
undirected graph or a set of ordered pairs for a
18-
directed graph. These pairs are known as edges, arcs,
19-
or lines for an undirected graph and as arrows,
20-
directed edges, directed arcs, or directed lines
21-
for a directed graph. The vertices may be part of
22-
the graph structure, or may be external entities
14+
A graph data structure consists of a finite (and possibly
15+
mutable) set of vertices or nodes or points, together
16+
with a set of unordered pairs of these vertices for an
17+
undirected graph or a set of ordered pairs for a
18+
directed graph. These pairs are known as edges, arcs,
19+
or lines for an undirected graph and as arrows,
20+
directed edges, directed arcs, or directed lines
21+
for a directed graph. The vertices may be part of
22+
the graph structure, or may be external entities
2323
represented by integer indices or references.
2424

25-
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
25+
![Graph](./images/graph.jpeg)
26+
27+
*Made with [okso.app](https://okso.app)*
2628

2729
## References
2830

‎src/data-structures/graph/README.pt-BR.md‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,9 @@ para um grafo direcionado.
1717
Os vértices podem fazer parte a estrutura do grafo, ou podem
1818
ser entidades externas representadas por índices inteiros ou referências.
1919

20-
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
20+
![Graph](./images/graph.jpeg)
21+
22+
*Made with [okso.app](https://okso.app)*
2123

2224
## Referências
2325

‎src/data-structures/graph/README.ru-RU.md‎

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
**Граф** в информатике - абстрактный тип данных, который должен реализовывать концепции направленного и ненаправленного
44
графа в математике, особенно в области теории графов.
55

6-
Структура данных графа состоит из конечного (и возможно изменяющегося) набора вершин или узлов, или точек, совместно с
6+
Структура данных графа состоит из конечного (и возможно изменяющегося) набора вершин или узлов, или точек, совместно с
77
набором ненаправленных пар этих вершин для ненаправленного графа или с набором направленных пар для направленного графа.
88
Эти пары известны как рёбра, арки или линии для ненаправленного графа и как стрелки, направленные рёбра, направленные
99
арки или направленные линии для направленного графа. Эти вершины могут быть частью структуры графа, или внешними
@@ -14,7 +14,9 @@
1414
информатике, могут быть представлены графами. Например, строение Википедии можно смоделировать при помощи
1515
ориентированного графа, в котором вершины — это статьи, а дуги (ориентированные рёбра) — гиперссылки.
1616

17-
![Граф](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
17+
![Граф](./images/graph.jpeg)
18+
19+
*Made with [okso.app](https://okso.app)*
1820

1921
## Ссылки
2022

‎src/data-structures/graph/README.zh-CN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,9 @@
1111

1212
如果顶点对之间的边是有权重的,该图可称为加权图。
1313

14+
![Graph](./images/graph.jpeg)
1415

15-
16-
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
16+
*Made with [okso.app](https://okso.app)*
1717

1818
## 参考
1919

132 KB
Loading[フレーム]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /