List of graph algorithms for coding interview

I am trying to list down all of the commonly used/asked graph algorithms that are asked on coding interviews.
Here is what I found so far.

• DFS: Tonnes of problems on Leetcode
• BFS: Tonnes of problems on Leetcode
• Union Find: Tonnes of problems on Leetcode
• Topological Sorting:
  • https://leetcode.com/problems/course-schedule/
• Single/Multi-source Shortest Path: Dijkstra, Bellman, Floyd-Warshall algorithm. Leetcode has good amount of problems on this topic. Few are following
  • https://leetcode.com/problems/network-delay-time/
• Minimum Spanning Trees: Prim's and Kruskal's algorithm.
  • https://leetcode.com/problems/optimize-water-distribution-in-a-village/
• Strongly Connected Components: Tarjan's Algorithm
  • https://leetcode.com/problems/critical-connections-in-a-network/
• Hierholzer's algorithm for Eulerian circuits.
  • https://leetcode.com/problems/reconstruct-itinerary/
• A* Search
  • https://leetcode.com/problems/sliding-puzzle/
• Max-Flow, Min-Cut
  • https://leetcode.com/problems/maximum-students-taking-exam/
• Articulation points and bridges
  • https://leetcode.com/problems/critical-connections-in-a-network/

Those are the main concepts and algorithms that I found after solving around 500 LC. But I am sure there's more. Can you please help me to list down all of the important graph algorithms and concepts that someone needs to know to handle any graph related problem gracefully?
Please put a comment mentioning the algorithms and concepts along with a link of any LC (at least one LC problem link) that can be solved with that. I will update the post accordingly.