<｜begin▁of▁sentence｜>### Instruction:
Given a graph with nodes [0, 1, 2, 3, 4] and edges [(0, 1), (1, 2), (2, 3), (3, 4), (4, 0), (0, 3), (1, 4)], how can we use the 'max_clique' API to find the maximum clique in the graph?
### Response:
import networkx as nx
from networkx.algorithms.approximation import max_clique

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

# Find the maximum clique
largest_clique = max_clique(G)

print('Maximum clique:', largest_clique)
<|EOT|>
