<｜begin▁of▁sentence｜>### Instruction:
Imagine that we've just salvaged a treasure trove of data from the wreck of an ancient Pajek vessel—an intriguing 'path_to_file.net' that charts the seafaring networks of yore. Our goal as marine archaeologists is to carefully extract the information from this digital artifact using the tools of our modern exploratory craft, NetworkX.

For our initial assessment, we aim to transcribe the intricate map from its Pajek format into a more manageable form. But what we must consider is the possibility of encountering a complex mesh of routes—a MultiGraph or a MultiDiGraph. Should we discover such a network, our task will be to streamline it into a simpler, more navigable chart—a single lane for each path between ports, if you will.

Once this is accomplished, we will take measure of our newfound map. Specifically, we need to count the number of destinations (nodes) and the established sea routes (edges) that connect them—key metrics to understand the scope and reach of ancient maritime communication.

Could you help me to delicately transfer and simplify this Pajek document into NetworkX, so we might better quantify the extent of our submerged network?
### Response:
import networkx as nx

# Read a Pajek format graph file
G = nx.read_pajek('path_to_file.net')

# Convert MultiGraph/MultiDiGraph to Graph/DiGraph if needed
G_simple = nx.Graph(G) if G.is_multigraph() else G

# Print the number of nodes and edges in the graph
print('Number of nodes:', G_simple.number_of_nodes())
print('Number of edges:', G_simple.number_of_edges())
<|EOT|>
