Skip to content

Commit 4d6d5da

Browse files
committed
Add README.
1 parent 7045392 commit 4d6d5da

File tree

1 file changed

+18
-0
lines changed

1 file changed

+18
-0
lines changed
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
# Graph
2+
3+
A graph data structure consists of a finite (and possibly
4+
mutable) set of vertices or nodes or points, together
5+
with a set of unordered pairs of these vertices for an
6+
undirected graph or a set of ordered pairs for a
7+
directed graph. These pairs are known as edges, arcs,
8+
or lines for an undirected graph and as arrows,
9+
directed edges, directed arcs, or directed lines
10+
for a directed graph. The vertices may be part of
11+
the graph structure, or may be external entities
12+
represented by integer indices or references.
13+
14+
![Graph](https://www.tutorialspoint.com/data_structures_algorithms/images/graph.jpg)
15+
16+
## References
17+
18+
[Wikipedia](https://en.wikipedia.org/wiki/Graph_(abstract_data_type))

0 commit comments

Comments
 (0)