Graph Algorithms in Java

Introduction

No.	Algorithm with Explanation	Code
1	Adjacency List to Adjacency Matrix	AdjListToAdjMatrix.java
2	Adjacency Matrix to Adjacency List	AdjMatrixToAdjList.java
3	Edges to Adjacency List
4	Edges to Adjacency Matrix

Intermediate

No.	Algorithm with Explanation	Code
5	Depth First Search (DFS) Recursive using Adjacency Matrix	DFSRecursiveAdjMatrix.java
6	Depth First Search (DFS) Recursive using Adjacency List
7	Depth First Search (DFS) Iterative using Adjacency Matrix
8	Depth First Search (DFS) Iterative using Adjacency List
9	Breadth First Search (BFS) using Adjacency Matrix
10	Breadth First Search (BFS) using Adjacency List
11	Union Find - Quick Find
12	Union Find - Quick Union
13	Union Find - Union By Rank
14	Union Find with Path Compression
15	Optimized Union Find
16	Topological Sorting Using DFS
17	Topological Sorting Using Kahn's BFS Algorithm
18	Detect Cycle in a Directed Graph
19	Detect Cycle in an Undirected Graph

Advanced

No.	Algorithm
20	Dijkstra's Algorithm - Shortest Path from source to all vertices
21	Floyd Warshall's Algorithm - Shortest Path from every vertex to every other vertex
22	Kruskal's Algorithm - Minimum Spanning Tree
23	Prim's Algorithm - Minimum Spanning Tree
24	Bellman Ford's Algorithm - Shortest Path from source to all vertices
25	Johnson's Algorithm - Shortest Path from every vertex to every other vertex
26	A* Search Algorithm
27	Is Graph Bipartite?
28	Graph Coloring