A graph algorithms visualizer written in Java visualizing the solution of the Strong Connectivity, Cycle Detection and Shortest Path problems

This project is a movie real-world web application that involves five main parts: Frontend using React, Backend using Node & Java to provide REST APIs management and finally two Databases modeling using MongoDB and PostgreSQL.

Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, and Enumeration of all permutation with alternate parities.

Implementation of DFS - strongly connected components on a Directed Graph, using same Object Oriented approach from SP08. Implementation of two versions of partition algorithms of Quick Sort and their comparison. Implementation of Dual-Pivot Quick Sort Algorithm.

A web tool to build, edit and analyze graphs

This is an archive of all my CSC-330 assignments.

Java based demonstration of Strongly Connected Components Search on an oriented graph using Depth First Search algorithm.

Working with graphs in Java

Implementation of the algorithm to find strongly connected components of a directed graph

Assignments from Algorithms Course like - All pairs shortest path, Common Substrings, Huffman Coding, K-nary Heaps, KMP, Line Sweep, Matrix Chain Multiplication, Maximum Flow, Quick Sort, Strongly Connected Components

DSA Graph Analysis Project

Application of Breadth-First Search to see if a directed graph is Strongly Connected

This project creates word ladders in directed and undirected graph generated from the words in the text file sub-words. It then finds the strongly connected components in the directed graph.