<｜begin▁of▁sentence｜>### Instruction:
As a museum educator, you are developing and leading a nature education program for visitors. You have already set up a network of marked paths in the forest, and you have recorded the connections between different locations. Now, you want to use a tool like the is_bipartite function in graph theory to determine if the network of paths can be divided into two sets in such a way that no two locations within the same set are directly connected by a path. If it is possible, you also need to retrieve the two disjoint sets of locations that make up the bipartition.
### Response:
import igraph as ig

# Create a graph with edge list
g = ig.Graph(edges=[(0, 1), (0, 2), (1, 3), (2, 3)])

# Check if the graph is bipartite and get the two parts if it is
is_bipartite, parts = g.is_bipartite()

# Print the result and the parts (if bipartite)
print('Is bipartite:', is_bipartite)
if is_bipartite:
    print('Parts:', parts)
<|EOT|>
