How to describe the process? The key words, like “relaxation”, etc.

Adjacency matrix (alphabet - alphabet) & Incidence matrix (number - alphabet)

BFS & DFS

Maximum Flow Problem (Ford-Fulkerson algorithm)

Minimum Spanning Tree

Single-source shortest path

Complexity

Just write down

Algorithm	Problem	Time Complexity	Space Complexity
Ford-Fulkerson	Max Flow	O(CE)

C: max flow value
E: # of edges | O(V+E)
V: # of vertices
E: # of edges | | Edmonds-Karp | Max Flow | O(V E^2) | O(V+E) | | Kruskal’s Algo | MST | O(ElogE) or O(ElogV) | O(V) | | Prim’s Algo | MST | O(E+VlogV) - Fibonacci Heap O(ElogV) - Binary Heap | O(V) | | Dijkstra’s Algo | single source shortest path | O(E+VlogV) - Fibonacci Heap O(ElogV) - Binary Heap | O(V) | | Bellman-Form Algo | single source shortest path | O(VE) | O(V) |