Degree centrality finction using Python

```
def degree_centrality(G):
top = set(G.nodes())
bottom = set(G.edges()) - top
s = 1.0/len(bottom)
centrality = dict((n,d*s) for n,d in G.edges(top))
s = 1.0/len(top)
centrality.update(dict((n,d*s) for n,d in G.edges(bottom)))
return centrality
degree_centrality(G)
```
I wrote this code but dosn't give the accurate result, plz can you help me to fix it