Compute degree distribution
The number of neighbors that a node has is called its "degree", and it's possible to compute the degree distribution across the entire graph. In this exercise, your job is to compute the degree distribution across T
.
This is a part of the course
“Introduction to Network Analysis in Python”
Exercise instructions
- Use a list comprehension along with the
.neighbors(n)
method to get the degree of every node. The result should be a list of integers.- Use
n
as your iterator variable. - The output expression of your list comprehension should be the number of neighbors that node
n
has - that is, its degree. Use thelen()
andlist()
functions together with the.neighbors()
method to compute this. - The iterable in your list comprehension is all the nodes in
T
, accessed using the.nodes()
method.
- Use
- Print the degrees.
Hands-on interactive exercise
Have a go at this exercise by completing this sample code.
# Compute the degree of every node: degrees
degrees = [____]
# Print the degrees