<｜begin▁of▁sentence｜>### Instruction:
Given an adjacency list formatted graph data as a dictionary with nodes '1', '2', and '3' where each node is connected to all the others, how would you convert this data into a NetworkX graph object and print the list of edges?
### Response:
import networkx as nx
from networkx.readwrite import json_graph

# adjacency list formatted graph data
adjacency_data = {
  'directed': False,
  'multigraph': False,
  'graph': [],
  'nodes': [
    {'id': '1'},
    {'id': '2'},
    {'id': '3'}
  ],
  'adjacency': [
    {'id': '1', 'adjacencies': [{'id': '2'}, {'id': '3'}]},
    {'id': '2', 'adjacencies': [{'id': '1'}, {'id': '3'}]},
    {'id': '3', 'adjacencies': [{'id': '1'}, {'id': '2'}]}
  ]
}

# Convert adjacency data to a NetworkX graph
G = json_graph.adjacency_graph(adjacency_data)

# Print the edges of the graph
print(list(G.edges()))
<|EOT|>
