<｜begin▁of▁sentence｜>### Instruction:
As a Supply Chain Analyst tasked with optimizing logistics operations, I need to identify all possible combinations of interconnected locations within our distribution network to streamline transportation routes. Using the networkx library, I aim to discover all the largest groups of linked locations, known as maximal cliques, within our network graph. The graph represents various distribution centers and their connections, with edges denoting direct transportation routes between them. By identifying these maximal cliques, I can strategize efficient delivery schedules and minimize transportation costs across our supply chain network.
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (2, 3), (0, 3), (3, 4), (4, 5), (5, 0)])

# Find maximal cliques in the graph
maximal_cliques = nx.find_cliques(G)

# Print maximal cliques
for clique in maximal_cliques:
    print(clique)
<|EOT|>
