<｜begin▁of▁sentence｜>### Instruction:
Imagine you're orchestrating a networking event to enhance collaboration opportunities between different departments within a company, represented by a directional flowchart. In this flowchart, arrows signify the planned interactions between departments: for instance, Marketing (0) is set to collaborate with Sales (1), Product Development (2) also has a liaison with Sales (1), and additionally, is planning a brainstorming session with the IT team (3). 

To ensure the entire event runs smoothly and all departments have the potential to interact either directly or through mutual acquaintances, can you determine, using the diagram layout provided in the edge set - [(0, 1), (2, 1), (2, 3)], if the interdepartmental flow is weakly connected, thus confirming that no team is isolated from the collaborative network?

(Please note that this scenario is theoretical and does not require an actual event map file or dataset; it's merely an illustrative depiction of the network's structure using the given edge set.)
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()

# Add edges
G.add_edges_from([(0, 1), (2, 1), (2, 3)])

# Check if the graph is weakly connected
is_connected = nx.is_weakly_connected(G)

print('Is the graph weakly connected?', is_connected)
<|EOT|>
