A Tutorial on NetworkX: Network Analysis in Python (Part-II)

NetworkX is a Python package for the creation, manipulation, and study of complex networks. It provides an easy-to-use interface for working with graphs and networks and includes a variety of graph algorithms that can be used to analyze and manipulate graph data.

In this tutorial, we will cover some of the most commonly used graph algorithms in NetworkX. The Part-I of this tutorial series is available at the following link:

A Tutorial on NetworkX: Network Analysis in Python (Part-I)

We will discuss the following graph algorithms supported by NetworkX:

1. Breadth-First Search (BFS),
2. Depth-First Search (DFS),
3. Shortest Path,
4. Dijkstra’s Algorithm,
5. Bellman-Ford Algorithm,
6. Girvan-Newman Algorithm,
7. Louvain Algorithm,
8. Label Propagation Algorithm.

Interested readers can also read the following tutorial which discusses in detail the basics of graph analysis in Python: