Problem Set – https://www.hackerrank.com/domains/algorithms/graph-theory/

Video Lecture –

Graph Representation part 01 – Edge List

Graph Representation part 02 – Adjacency Matrix

Graph Representation part 03 – Adjacency List

Important Problem Set –

1. Breadth First Search (BFS)

2. Depth First Search (DFS)

3. Shortest Path from source to all vertices **Dijkstra**

4. Shortest Path from every vertex to every other vertex **Floyd Warshall**

5. To detect cycle in a Graph **Union Find**

6. Minimum Spanning tree **Prim**

7. Minimum Spanning tree **Kruskal**

8. Topological Sort

9. Boggle (Find all possible words in a board of characters)

10. Bridges in a Graph

**“Graphs are really important at Google. There are 3 basic ways to represent a graph in memory (objects and pointers, matrix, and adjacency list); familiarize yourself with each representation and its pros & cons. You should know the basic graph traversal algorithms: breadth‐first search and depth‐first search. Know their computational complexity, their tradeoffs, and how to implement them in real code. If you get a chance, try to study up on fancier algorithms, such as Dijkstra and A*.”**

Boggle (Find all possible words in a board of characters) | Set 1