An undirected graph is a graph in which an orientation on edges is not specified, in contrast
to directed graphs. For this reason, the edge connecting vertices
When the term "graph" is used without specification, we typically assume that the graph is undirected.