<｜begin▁of▁sentence｜>### Instruction:
As an Event Coordinator, imagine you're tasked with creating a layout for a networking event where each guest is represented by a node, and the connections between them are the potential interactions based on common interests. You've compiled this information into a list format for easier visualization and management. Your list looks something like this: {0: [1, 2, 3], 1: [0, 2], 2: [0, 1], 3: [0]}, where each guest is identified by a number, and the connections are represented by who they'll likely interact with at the event.

Your challenge now is to translate this list into a more visual and structured format using NetworkX software, which will help you to create a graph representation of the event's networking layout. Your goal is to input this adjacency list into NetworkX to generate a comprehensive graph, and then to ascertain the full set of interactions by listing out all the edges within this newly created network graph. This visual tool will be pivotal in helping you to execute a smooth and engaging networking event.
### Response:
import networkx as nx

dol = {0: [1, 2, 3], 1: [0, 2], 2: [0, 1], 3: [0]}
G = nx.from_dict_of_lists(dol)
print(G.edges())
<|EOT|>
