Graph Algorithms and Tasks

Table of Contents

graphs:

1. Bellman-Ford Algorithm
2. Dijkstra's Algorithm
3. Breadth-First Search (BFS)
4. Depth-First Search (DFS)
5. Graph Creation
   • Unweighted & Undirected Graph
   • Weighted & Undirected Graph
6. Graph Representation
   • Adjacency Matrix
   • Adjacency List
7. Print All Paths
8. Topological Sorting
9. Cycle Detection
   • Cycle Detection in Directed Graph
   • Cycle Detection in Undirected Graph
10. GraphCreationUsing2DArray
11. [Prim's algo](#Prim's algo)
12. [Kosaraju's algo](#Kosaraju's algo)
13. [Edge converter](#Edge converter)
14. [getBridge Problem](#getBridge Problem)
15. [Tarjan's algorithm](#Tarjan's algorithm)

Stack:

Queue:

LinkedList:

binaryTree:

binarySearchTree:

List:

sorting:

String:

Arrays:

HashShing(google has soft spot for it):

1. HashSet(notes are in the form of code+dsa notes)
2. HashMap(notes are in code + dsa notes)
3. Set
4. [HashMap implementation](#HashMap implementation)