added algorithms related to graphs

[nishakp3005]

📥 Pull Request

Description

This pull request introduces the implementations of Prim's Algorithm, Kruskal's Algorithm, Kahn's Algorithm, and Depth-First Search (DFS) Based Topological Sort to the project, Kosaraju's algorithm, tarjan's algorithm, A* Algorithm and a detailed description about Graphs. These algorithms are essential for graph manipulation and are widely used in various applications such as network design and task scheduling.

These additions enhance the functionality of our graph algorithms library and provide users with more tools for solving complex problems.

Fixes #41

Type of change

• New feature (non-breaking change which adds functionality)

Checklist:

• My code follows the style guidelines of this project
• I have performed a self-review of my code
• I have commented my code, particularly in hard-to-understand areas
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Any dependent changes have been merged and published in downstream modules

[nishakp3005]

@ajay-dhangar kindly review my changes

[ajay-dhangar]

done

[nishakp3005]

@ajay-dhangar do I have to make any other changes?