<｜begin▁of▁sentence｜>### Instruction:
Assuming we have an edgelist file that represents a network, where each line contains two node identifiers separated by whitespace, can you read this edgelist file into a NetworkX graph, while also retrieving the list of unique vertices? After importing and creating the graph, you should calculate and print the number of connected components in the graph.
### Response:
import networkx as nx
from graspologic.utils import import_edgelist

# Assuming we have an edgelist file located at 'path/to/edgelist.txt'
path = 'path/to/edgelist.txt'

# Use graspologic's import_edgelist function
# to load the edgelist as an adjacency matrix
adjacency_matrix, vertices = import_edgelist(path, nodetype=int, return_vertices=True)

# Create a new NetworkX graph from the adjacency matrix
G = nx.from_numpy_array(adjacency_matrix)

# Add the imported vertices to the graph
G.add_nodes_from(vertices)

# Analyze the graph, for example, by finding the number of connected components
connected_components = nx.number_connected_components(G)
print('Number of connected components:', connected_components)
<|EOT|>
