Think of a graph as a simple way to map relationships. It's not the kind of graph you see in a math class with x and y axes. In this context, a graph is a collection of dots and the lines connecting them. It's a visual language for showing how things are linked, whether it's friends in a social network, cities on a map, or steps in a process.

Every graph is made of two basic ingredients: vertices and edges.

Together, these two parts form a graph. Let's look at a simple one. Here, the circles are vertices (let's call them A, B, C, and D), and the lines are the edges connecting them.

Sometimes, the relationship between two vertices is a two-way street. If you're friends with someone on Facebook, they are also friends with you. The connection is mutual. This is an undirected graph. The edges are like simple lines; they don't have a specific direction.

Other times, the relationship is one-way. On Twitter, you might follow a celebrity, but that doesn't mean they automatically follow you back. This is a directed graph, or digraph. The edges are drawn as arrows to show which way the relationship goes.

In the directed graph, the arrow from A to B shows that A follows B. The arrow from C to B shows that C follows B. There's no arrow going from B to A, so the relationship isn't mutual in that case.

We have specific terms to describe how vertices are connected. If an edge exists between two vertices, we say they are adjacent.

We can also count the connections a vertex has. This count is called the degree of a vertex. In an undirected graph, it's simply the number of edges touching that vertex.

For directed graphs, we get more specific. The number of arrows pointing to a vertex is its in-degree. The number of arrows pointing away from it is its out-degree.

Most of the graphs we've seen so far are simple graphs. This means they follow two rules:

1. There's at most one edge between any two vertices.
2. No vertex has an edge that connects back to itself (this is called a loop).

But what if we need to represent more complex relationships? For that, we use a multigraph. A multigraph can have multiple edges between the same two vertices and can also have loops.

A multigraph might be useful for modeling a city's transportation network. Vertices could be locations, and edges could be different modes of transport. You might have two edges between 'Downtown' and 'Uptown': one for the subway and one for the bus. A loop could represent a sightseeing bus tour that starts and ends at the same landmark.

Now, let's test your understanding of these fundamental concepts.