<｜begin▁of▁sentence｜>### Instruction:
As a real estate agent facilitating the buying, selling, or renting of properties on behalf of clients, imagine you're tasked with analyzing a property network that consists of interconnected buildings. Each building is represented as a vertex in the network, and the connections between the buildings represent pathways linking them.

To calculate the eccentricity of all buildings in the property network, you could use the igraph library's in-built functions. This will allow you to determine the furthest distance from each building to any other building in the network, providing valuable insight into the accessibility and centrality of the different properties.
### Response:
from igraph import Graph

# Create an undirected graph with some vertices and edges
vertices = ['A', 'B', 'C', 'D', 'E']
edges = [('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('E', 'A')]
g = Graph(edges=edges, directed=False, vertex_attrs={'name': vertices})

# Calculate the eccentricity of each vertex
eccentricities = g.eccentricity(mode='all')

# Print the eccentricity of each vertex
for vertex, ecc in zip(vertices, eccentricities):
    print(f'Vertex {vertex} has eccentricity: {ecc}')
<|EOT|>
