igraph_quickstart_graph_creation_attributes_shortest_path.py

1import igraph as ig
2
3# Create a new graph with 3 vertices
4g = ig.Graph(n=3)
5
6# Add edges between vertices
7g.add_edges([(0, 1), (1, 2)])
8
9# Add more vertices and edges
10g.add_vertices(2)
11g.add_edges([(2, 3), (3, 4), (0, 4)])
12
13# Assign names to vertices
14g.vs["name"] = ["Alice", "Bob", "Claire", "Dennis", "Esther"]
15
16# Assign ages to vertices
17g.vs["age"] = [25, 31, 18, 47, 22]
18
19# Assign a type to edges (is_formal)
20g.es["is_formal"] = [False, False, True, True, True]
21
22# Print a summary of the graph
23print(g)
24
25# Find the shortest path between Alice and Dennis
26path = g.get_shortest_paths("Alice", to="Dennis")[0]
27print(f"Shortest path from Alice to Dennis: {path}")
28
29# Calculate the degree of all vertices
30degrees = g.degree()
31print(f"Vertex degrees: {degrees}")
32
33# Plot the graph (requires a plotting backend like matplotlib or cairocffi)
34# ig.plot(g, target="graph.png")