Graph Algorithms Implementation

This repository contains Python implementations of various graph algorithms. Each algorithm is provided in a separate Jupyter Notebook for easy understanding and testing.

Contents

1. General Discussion on Graphs

   • Introduction to graph theory concepts.

2. Undirected Path

   • Implementation of an algorithm to find an undirected path in a graph.

3. Count Connected Components

   • Algorithm to count the number of connected components in an undirected graph.

4. Largest Component

   • Implementation to find the largest connected component in an undirected graph.

5. Find Shortest Path

   • Algorithm to find the shortest path in a graph.

6. Island Count

   • Implementation to count the number of islands in a 2D grid.

7. Minimum Island Size

   • Algorithm to find the minimum size of islands in a 2D grid.

Usage

Feel free to explore each notebook for detailed explanations, code implementation, and example use cases. You can run the notebooks in your preferred Jupyter Notebook environment to experiment with the algorithms.