JavaScript algorithms and data structures

Course Schedule

Projeto da disciplina Teoria dos Grafos

All interview question.

Optimizing Kosaraju's Algorithm for Strongly Connected Components in Large Graphs Using Mypyc

Optimized 32-Bit Full Adder, CEC-SAT Verifier & 2-SAT Solver

Implementation of graph algorithms

A collection of sorting algorithms and data structures implemented in C++. Each algorithm and data structure comes with its own set of test cases to ensure correctness and robustness.

CEC-SAT Verifier, Optimized 32-Bit Full Adder & 2-SAT Solver

This Project was aimed to apply concepts of Optimization in some Real world problem. In this project we've considered a real-life situation of building a new airport and finding minimum number of new flights which needs to be introduced to the existing flight-network of the world such that any person boarding from newly built airport can reach t…

Projeto prático desenvolvido durante a matéria de Teoria dos Grafos

Code for the first pratical task of Algorithms I, involving unweighted graphs, traversal and connectivity

General search tool for both directed and undirected graph data structure in C++

Graph algorithms studied in the Graph Theory and Application class at Universidade de Brasília (UnB) in the first semester of 2021.

The project aims to implement a server capable of handling graph operations and computing strongly connected components (SCCs) using Kosaraju's algorithm. It is designed to efficiently manage multiple client connections.