How can I use Python for graph theory?

How can I use Python for graph theory?

You can use libraries like NetworkX and Matplotlib to create and visualize graphs in Python.

Can you show me a simple example of creating a graph?

Sure! Here's a basic example using NetworkX:

import networkx as nx
import matplotlib.pyplot as plt

G = nx.Graph()
G.add_edges_from([(1, 2), (1, 3), (2, 4)])

nx.draw(G, with_labels=True)
plt.show()

What are some common algorithms used in graph theory?

Common algorithms include Dijkstra's for shortest paths, Kruskal's and Prim's for minimum spanning trees, and depth-first search.

How can I implement Dijkstra's algorithm in Python?

You can implement Dijkstra's algorithm using NetworkX as follows:

import networkx as nx

G = nx.Graph()
G.add_weighted_edges_from([(1, 2, 1), (1, 3, 4), (2, 3, 2)])

shortest_path = nx.dijkstra_path(G, source=1, target=3)
print(shortest_path)