<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [('A', 'B'), ('A', 'C'), ('C', 'D'), ('D', 'E')], how can you use NetworkX to represent this graph's adjacency as a dictionary of lists, possibly ignoring any edge data?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B'), ('A', 'C'), ('C', 'D'), ('D', 'E')])

# Use to_dict_of_lists to get adjacency representation
G_adj_list = nx.to_dict_of_lists(G)

print('Adjacency list representation of the graph:', G_adj_list)
<|EOT|>
