[NEW ALGORITHM] for Longest path in DAG

[sujitgunjal]

📥 Pull Request

Description

This pull request introduces a new feature that calculates the longest path in a Directed Acyclic Graph (DAG) from a specified source vertex. The algorithm uses topological sorting and dynamic programming to efficiently find the longest path from the source to each vertex. Distances are set to infinity for vertices that are unreachable from the source. Additionally, basic test cases are provided to verify the code's functionality.

Key improvements:

• Enhanced code comments for better readability and understanding.
• A LongestPathInDAGTest class to demonstrate basic test cases and validate output.
• Compliance with coding style and project conventions.

Fixes #1582

Type of change

• Bug fix (non-breaking change which fixes an issue)
• ✅ New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• Documentation update

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

[github-actions]

Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊

[github-actions]

⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀

🔗 Site: Algo | Live Site

URL 🌐	Performance	Accessibility	Best Practices	SEO	📊
/algo/	🔴 45	🟢 96	🟡 71	🟡 86	📄
/algo/docs	🔴 46	🟢 96	🟡 75	🟢 100	📄
/algo/blog	🟡 67	🟢 92	🟢 96	🟡 86	📄

[ajay-dhangar]

Please write your code in the docs folder, not outside of the docs folder. This will ensure that your code is organized and easy to find.