Generating the adjacency matrix for a network
One potent tool for analyzing graphs is the adjacency matrix, which has entries 
if there is an edge from node 
to node 
, and 0 otherwise. For most networks, the adjacency matrix will be sparse (most of the entries are 0). For networks that are not directed, the matrix will also be symmetric (
). Numerous other matrices can be associated with a network. We will briefly discuss these in the There’s more... section of this recipe.
In this recipe, we will generate the adjacency matrix for a network and learn how to get some basic properties of the network from this matrix.
Getting ready
For this recipe, we will need the NetworkX package imported under the nx alias, and the NumPy module imported as np.
How to do it...
The following steps outline how to generate the adjacency matrix for a network and derive some simple properties of the network from this matrix:
- First, we will generate a network to work with throughout...
