@@ -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
1111directed graph concepts from mathematics, specifically
1212the 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
2323represented 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
0 commit comments