[Feature Request]: Implementing Greedy Algorithm for Graph Optimization in C++ under DSA folder.

[sjain1909]

Is there an existing issue for this?

• [X] I have searched the existing issues

Feature Description

I propose implementing a greedy algorithm specifically designed for graph optimization problems, such as finding a minimum spanning tree or the shortest path. This feature would enable users to apply a greedy approach to various graph-related tasks, improving efficiency and usability.

Use Case

This feature would enhance my use of the project by allowing for quicker solutions to common graph problems. For instance, in a scenario where we need to find the shortest path in a network of nodes (such as transportation routes), this greedy approach can significantly reduce computation time compared to other algorithms.

Benefits

Implementing the greedy algorithm for graph optimization will significantly enhance project efficiency by providing faster solutions to common problems like minimum spanning trees and shortest paths. This feature will make the tool more user-friendly, allowing developers of varying skill levels to easily apply graph algorithms.

Add ScreenShots

No response

Priority

High

Record

• [X] I have read the Contributing Guidelines
• [X] I'm a GSSOC'24 contributor
• [X] I have starred the repository

[github-actions[bot]]

Hi @sjain1909! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[sjain1909]

@Ajay-Dhangar sir, kindly assign me this issue under GSSOC'24.

[sjain1909]

@Ajay-Dhangar sir, kindly assign me this issue under GSSOC'24.

[ajay-dhangar]

@sjain1909, Please remember to follow our Guidelines for Writing DSA Problem Solutions

[github-actions[bot]]

Hello @sjain1909! Your issue #3488 has been closed. Thank you for your contribution!