Infinite path length of graph for networkx

Question

I'm making a graph from an adj matrix, here is my code, I try to first make the graph, then put a weight with that graph as seen here ``` for element in elements: senMatrix[int(element.matrix_row)-1,int(element.matrix_column)-1]=1 G=nx.from_numpy_matrix(senMatrix) for element in elements: G[int(element.matrix_row)-1][int(element.matrix_column)-1]['weight']=int(element.value) print str(G.nodes()) print str(G.edges()) avgClusterNumber=nx.average_clustering(G,weight='weight') clusterList=nx.clustering(G,weight='weight') graphDiameter=nx.diameter(G) ``` The first two functions run without a problem, the last diameter function however throws an issue with infinite path length when which makes me think there are no edges or nodes or something. Error seen here ``` networkx.exception.NetworkXError: Graph not connected: infinite path length ``` When I print them out I get this ``` [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30,…

Accepted Answer

try

```
nx.is_connected(G)
```

if it returns False then you can separate the graph by components and find the diameter for each component, using

```
connected_components(G)
```

Infinite path length of graph for networkx

Solution

Problem