🔥 shortest path → Shortest-path algorithms on weighted graphs minimize total path cost by aggregating edge weights (typically summing) and performing edge relaxations; weight properties (e.g., non-negative vs. negative) determine algorithm choice (Dijkstra vs. Bellman–Ford) and correctness.

🌟 minimum spanning tree →

⚡️ floyd-warshall algorithm →

⚡️ boruvka algorithm →

⚡️ prim algorithm →

⚡️ kruskal algorithm →

⚡️ dijkstra algorithm →

⚡️ bellman-ford algorithm →

⚡️ a star search →