Question

The scoff-Northwester25 network in the book's Github respoitory is a snop shot of northwestern University face book network. the nodes are anonymous users and the links are friend relationships. load this network into a network x graph in order to answer the following question. Be sure to use proper graph class for undirected. unweighted network.

1- How many nodes and links are in this network

2- which of the following best describes the connectedness of this network

a. strongly connected

b. weakly connected

c. connected

d. Disconnected

3. We want to obtain some idea about the average length of paths in this network. but with large networks like this it is often too computationally expensive to calculate the shortest path between every pair of nodes. if we wanted to compute the shortest path between every pair of nodes in this network. how many shortest path calculations would be required? in other words how many pairs of nodes are there in this network

Answer 1

A graph is the pictorical representation of a set of objects. Some pair of objects are connected by links. The interconnected objects are represented by vertices and edges.  

  A graph is a set of (V,E) where V is the vertices and E is the edges.

1. 25 nodes and 40 links are in this network
2. The best connectedness of this network is Connected

The connected components of the undirected graph is a subgraph which two vertices are connected to each other.No additional vertices in a sub graph.

​​​​​​​