<｜begin▁of▁sentence｜>### Instruction:
Given a graph with 5 vertices named 'A', 'B', 'C', 'D', and 'E' and edges connecting them in a path (e.g., A-B, B-C, C-D, D-E), how would you convert this graph into a dictionary of lists representation using the vertex names instead of their IDs?
### Response:
from igraph import Graph

# Create an example graph with named vertices
g = Graph(edges=[(0, 1), (1, 2), (2, 3), (3, 4)], vertex_attrs={'name': ['A', 'B', 'C', 'D', 'E']})

# Export the graph to a dictionary of lists using vertex names
g_dict = g.to_list_dict(use_vids=False, sequence_constructor=list, vertex_name_attr='name')

# Print the dictionary representation of the graph
print(g_dict)
<|EOT|>
