<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with the edges [(0, 1), (1, 2), (0, 2), (3, 4), (4, 5), (3, 5), (2, 3), (5, 6)], can you use the community_fastgreedy function in igraph to find the community structure?
### Response:
from igraph import Graph

# Example to demonstrate community detection using the fastgreedy algorithm

# Define the edge list
edges = [(0, 1), (1, 2), (0, 2), (3, 4), (4, 5), (3, 5), (2, 3), (5, 6)]

# Create the graph
graph = Graph(edges=edges)

# Find community structure
fastgreedy_result = graph.community_fastgreedy()

# Convert it into an actual clustering
clusters = fastgreedy_result.as_clustering()

# Print the membership list of the clustering
print(clusters.membership)
<|EOT|>
