Graphs are such an integral part of the study of computer science, yet many people get confused about the vernacular associated with them. This is the first post in a series of posts about various data structures and algorithms.

Here are some common terms associated with graphs you should know:

The ratio of possible pairs of vertices to edges that are connected is known as the *density* of the graph.

A graph that has relatively few of the possible edge, vertex combinations is known as a *sparse* graph.

A graph that has the majority of the possible edge, vertex combinations is known as a *dense* graph.

If a path exists from every vertex to every other vertex in the graph it is considered a *connected* graph.