B Breadth-First Search (BFS) Graphs B Depth-First Search (DFS) B Breadth-First Search (BFS) B Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graph A Dijkstra Algorithm - finding the shortest paths to all graph vertices from single vertex A Bellman-Ford ...