40 Algorithms Every Programmer Should Know

Degree

The number of edges connected to a particular vertex is called its degree. It can indicate how well connected a particular vertex is and its ability to quickly spread a message across a network.

Let's consider aGraph = (𝓥, 𝓔), where 𝓥 represents a set of vertices and 𝓔 represents a set of edges. Recall that aGraph has |𝓥| vertices and |𝓔| edges. If we divide the degree of a node by (|𝓥| -1), it is called degree centrality:

Now, let's look at a specific example. Consider the following graph:

Now, in the preceding graph, vertex C has a ...