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.

🚪 Find the entry points in a set of JavaScript files.

Comparing performance of Tarjan algo v/s Schmidt decomposition for checking biconnectedness of undirected graphs (sparse, dense, non-biconnected, large number of nodes, etc.)

Visualizador de componentes fortemente conexos (SCC)

Multipole Analysis and Graph Visualization

tema2-pa

Graph problems

Yet another framework-agnostic tarjan scc detection algorithm implementation for Java applications

🖇️Implementação concorrente do algoritmo de Tarjan (busca em profundidade de componentes fortemente conexos)

Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components and SSReflect [maintainers=@CohenCyril,@palmskog]

Implementasi Algoritma Tarjans untuk mencari SCC dan bridge

Frontend side of SCC and Bridges Finder using Tarjans Algorithm with React Typescript and Golang

Backend side of SCC and Bridges Finder using Tarjans Algorithm with React Typescript and Golang

Program to create a list of people where everyone is connected to at least one other person.

Repository for all solutions for Algorithms class

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…

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

JavaScript implementation of Tarjan's strongly connected components algorithm

Identifying the subnetworks of a product distribution network using Tarjan's strongly connected components algorithm.