|
|
|
|
|
|
by icsa
1634 days ago
|
|
|
Yes, I forgot Depth-First Search/Traversal and Breadth-First Search/Traversal. Those two algorithms are the workhorses of graph algorithms. Advanced graph algorithms include Dijkstra's algorithm, Minimum Spanning Tree, Strongly Connected Components, among others. In addition, dynamic programming (DP) also shows up as a more advanced algorithm/technique in high-level interviews. |
|
|