Added Graphs Algorithims

[abhay-dev2901]

Description:

Added implementations of popular graph algorithms - Breadth-First Search (BFS), Depth-First Search (DFS), and Dijkstra's Algorithm. These algorithms are foundational for graph traversal and shortest-path finding, contributing to the repository's collection of core graph algorithm implementations. This update enhances the range of algorithms available and can serve as a reference for learners and practitioners.
Fixes #issue_number_here

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 own code.
• I have commented my code, particularly in hard-to-understand areas.
• I have made corresponding changes to the documentation.
• My changes generate no new warnings.
• 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.
• Necessary documentation changes done
• I have added the file in the correct directory

Screenshots / Video: