Add Minimum Spanning Tree in Master Key Graph Algorithms section

[sarthaxtic]

Feature Summary

Add a brief summary, use cases and algorithms like Prim's and Kruskal's under a section of Minimum Spanning Tree under Master Key Graph Algorithms section.

Description

MST is an important graph concept along with algorithms like Prim's and Kruskal's which are necessary.

Proposed Solution

No response

Alternatives Considered

No response

Screenshots/Logs

No response

Additional Information

• I have searched for existing feature requests
• I am willing to help implement this feature
• I can provide more details or clarification if needed