[igraph] Calculation of Coordination Number

[Lorenzo Isella]

Dear All,
Probably I am not using the right terminology, but I am studying 
aggregates of physical particles rather than "traditional graphs".
The problem is the following: suppose you are given an adjacency matrix. 
You can identify (via igraph) the connected components.
But now, you want to calculate how many edges each node has on average. 
If we were talking about particles, this would be the mean number of 
first neighbors each particle has (and would give an idea of the 
openness of the aggregate).
Any idea about how this can be achieved in igraph? In case it matters, I 
am primarily using the Python bindings.
Many thanks

Lorenzo