🔥 minimum spanning tree → A minimum_spanning_tree is constructed by executing prim_algorithm, which incrementally adds the lightest crossing edge to connect all vertices, yielding a valid MST for the input graph.

🌟 kruskal algorithm →

🌟 boruvka algorithm →

⚡️ dijkstra algorithm →

⚡️ maximum spanning tree →

⚡️ greedy algorithm →