All my implemented solutions of various problems of different online judges and competitions

Repository of scripts and data for the "Robustness and resilience of complex networks" paper by Oriol Artime, Marco Grassia, Manlio De Domenico, James P. Gleeson, Hernán A. Makse, Giuseppe Mangioni, Matjaž Perc and Filippo Radicchi, published at Nature Review Physics (2024). https://doi.org/10.1038/s42254-023-00676-y

finding a short spanning walk throw a connected graph (NP-HARD problem)

新型配电系统故障恢复优化NP-hard问题的无损转化算法

Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.

Записките ми за упражнения по "Дизайн и анализ на алгоритми"

An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C

Y.Neo Graph のイメージ (publish in 2002, 2023(the code))

Ant Colony Optimization meta heuristic algorithm visualization + solving Travel Sales man problem.

Solving Single Machine Schenduling problem with different approaches

Comparative Analysis of Solutions to the NP-hard Problem: Travelling Salesman Problem.

Traveling Salesman Problem - Explore various algorithms, approximations, and heuristics, aiming to find the most efficient and accurate solution in terms of time and results

Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem

Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem

Na Rinha de Algoritmos você deve utilizar suas habilidades para a criação de algoritmos eficientes para resolver problemas!

Scala library for solving NP-hard probems

Computer Science 170: Efficient Algorithms and Intractable Problems

A local search algorithm to solve the Minimum-Weighted Vertex Cover (MWVC) problem.

A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.

Trying to find a maximum clique in a Graph