Graph Introduction
Do you mean the graphs they teach you in school?
Well, if you mean the graphs they teach you in mathematics like a bar graph, not necessarily. I mean graphs in computer science terms.
“A graph data structure consists of a finite (and possibly mutable) set of vertices (also called nodes or points), together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges (also called links or lines), and for a directed graph are also known as arrows.” — Wikipedia
Two Major Types OF Graphs
Directed Graphs
A directed graph is an ordered pair: G = (V, E)
V is a set of vertices — also known as nodes or points
E is a set of edges — , a set of edges (also called directed edges, directed links, directed lines, arrows or arcs) which are ordered pairs of vertices (that is, an edge is associated with two distinct vertices). — Wikipedia
Directed graphs (also known as a Digraph) have edges with directions. The edges indicate a one-way relationship, meaning that each edge is only traversed in a single direction.
