What is NetworkX and how can I use it for graph theory?

What is NetworkX and how can I use it for graph theory?

NetworkX is a Python library for creating, manipulating, and studying complex networks. You can use it to model graphs and analyze their properties.

Can you give me an example of how to create a simple graph using NetworkX?

Sure! You can create a simple graph using the following code:

import networkx as nx
G = nx.Graph()
G.add_edges_from([(1, 2), (2, 3), (3, 1)])

How can I visualize the graph I just created?

You can visualize the graph using Matplotlib. Just add this code:

import matplotlib.pyplot as plt
nx.draw(G, with_labels=True)
plt.show()

What are some common algorithms I can implement with NetworkX?

NetworkX supports various algorithms like Dijkstra's for shortest paths, PageRank for ranking nodes, and community detection algorithms.