[Feature Request]: Implementation of Longest path in DAG under Dynamic Programming

[shuvojitss]

Is there an existing issue for this?

• [X] I have searched the existing issues

Feature Description

Description

Given a weighted directed acyclic graph (DAG) and a source vertex, find the cost of the longest path from the source vertex to all other vertices present in the graph. If the vertex can’t be reached from the given source vertex, print its distance as infinity.

Input:

Source vertex and the cost matrix or the dajacency list as per your wish.

Output:

Longest path from source vertex to all other vertices.

Record

• [x] I agree to follow this project's Code of Conduct
• [X] I want to work on this issue
• [X] I'm willing to provide further clarification or assistance if needed.

Full Name

Shuvojit Samanta

Participant Role

GSSOC

[github-actions[bot]]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[shuvojitss]

@UTSAVS26 please assign the issue.

[UTSAVS26]

@UTSAVS26 please assign the issue.

You can raise a PR of this issue i will assign you that alongwith labels.