Degree Centrality

your browser does not support the canvas tag

This is program generates a graph and calculates the Normalized Degree Centrality of each node. The normalized degree centrality of a node v in a graph G = (V,E) measures how many nodes are connected to the node v, compared to the maximum possible number of edges that can be connected to this node. Because we are dealing with simple undirected graphs (at most a single edge between any two distinct vertices), this maximum possible number will always be |V - 1|. So the normalized degree can be calculated by dividing the degree of the node (the number of nodes it is connected to) by |V - 1|.