Compute degree centrality for nodes.
The degree centrality for a node v is the fraction of nodes it is connected to.
If v=None, returns a dict of degree centrality values keyed by node. Otherwise, returns the degree centrality of the node v.
The degree centrality is normalized to the maximum possible degree in the graph G. That is, G.degree(v)/(G.order()-1).