✨ DAY 26: Graph (Prims, Kruskal, Dijkstra, BFS, DFS, Union Find Algorithm ✨
📌 Graphs are mathematical structures that reflect the pairwise relationship between things. A graph is a type of flow structure that displays the interactions of several objects. It may be represented by utilizing the two fundamental components, nodes and edges.
✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;
- https://www.geeksforgeeks.org/graph-and-its-representations/
- https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/
- https://www.softwaretestinghelp.com/graph-implementation-cpp/
- https://www.programiz.com/dsa/graph
- https://www.javatpoint.com/java-graph
- https://www.baeldung.com/java-graphs
📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀;
- https://youtube.com/playlist?list=PLgUwDviBIf0oE3gA41TKO2H5bHpPd7fzn
- https://youtu.be/eGc5TQpBMjA
- https://youtu.be/TwdjOQMTaQ4
- https://youtu.be/EaK6aslcC5g
👨💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱: 👇
Prims and Kruskal Algorithm
- https://leetcode.com/problems/min-cost-to-connect-all-points/solutions/1135506/prims-algorith-and-kruskals-algorithm/ Dijkstra Algorithm
- https://leetcode.com/problems/network-delay-time/solutions/174339/c++-Easy-to-understand-Dijkstra's-algorithm/ Union Find Algorithm
- https://leetcode.com/discuss/general-discussion/1072418/Disjoint-Set-Union-(DSU)Union-Find-A-Complete-Guide BFS & DFS
- https://leetcode.com/discuss/study-guide/1072548/A-Beginners-guid-to-BFS-and-DFS