<｜begin▁of▁sentence｜>### Instruction:
As a freight broker tasked with optimizing complex shipping logistics, imagine you've come across a network with hubs and routes that closely resembles the renowned Hoffman-Singleton Graph – a marvel of balance and symmetry, structured with an intricate array of 50 pivotal nodes, akin to distribution centers, and 175 connecting routes, mirroring the direct links between these centers. To streamline our operations and ensure maximum efficiency in our dispatching algorithm, could we bring this graph to life using NetworkX? I'm particularly interested in unpacking its basic statistics: the exact count of distribution centers and direct routes that compose this network. This would arm us with critical insights to possibly revolutionize our logistical frameworks.
### Response:
import networkx as nx

# Generate the Hoffman-Singleton graph
HS_graph = nx.hoffman_singleton_graph()

# Print basic information about the graph
print('Number of nodes:', HS_graph.number_of_nodes())
print('Number of edges:', HS_graph.number_of_edges())
<|EOT|>
