Assembled Phi-X174 genome using Overlap Graph, Kmer Composition and De-Bruijn Graph.

CPP codes for some popular algorithms

Solves Travelling salesman problem with searching for Hamiltonian Circuit

This project uses Q-Learning, Hamiltonian Cycles and Breadth First Search to play Snake. Mazes can also be drawn for the snake to navigate through.

Esta aplicação fornece uma interface web a fim de demonstrar o uso do Algoritmo de colonização de formigas Antsystem

Some little games implementation, and also, machine learning implementation.

Quantum Computing with IBM's Qiskit toolkit

Blender Python API scripting to create all hamiltonian paths through a mesh

Discrete Mathematics course at ITMO University

No description provided.

RouteXplorer is a lib developed to optimize routes in Complete Graphs.

Graph Theory in computer Application. Features of Graph Theory project are: Bipartile, Planner, Tree, paths of 1,2,3,... n length, cycles (loops) of 3,4,,,,n length, Euler paths or cycles, Hamilton paths and cycles, Color the graph, Check Izomorphism with other graph, Short Path between Two Nodes etc.

Mathematical Model used for the rebalancing problem in bike-sharing system

Hamiltonian Cycles, as traversed by Mayoi Hachihachiji (undergrad project)

Tests the, still open, Ruskey-Savage Conjecture (1993) for small values of n. Searches for Hamiltonian cycle with constraints. (Final project for Non-procedural programming course.)

Java Programs and Algorithms

No description provided.

This snake game solver is represented by an undirected graph and the Hamiltonian Cycle algorithm that generates path visiting each vertex exactly once. This approach ensures that the snake will never collide and maximum score will be achieved.

🐍 SNAKE AI - Had, který vždy vyhraje! 🏆🤖🔥

An Investigation into the Computational Complexity of DHCP.

WIP - A snake game in java, allowing to play manually and challenge different bots.

The phi X 174 bacteriophage is a single-stranded DNA virus that infects Escherichia coli (E. Coli), and the first DNA-based genome to be sequenced. This work was completed by Fred Sanger and his team in 1977. This repository contains simple assembler, different components of it and various error correction techniques for assembling Phi X 174 bacteriophage

Find all the Hamiltonian Cycles present in given graph

Python program to benchmark quantum annealed solutions of the travelling salesman problem against classical bruteforce and heuristic methods.

Try finding a Hamiltonian path/cycle in the planar dodecahedron graph (play Hamilton's Icosian game).

A rust translation of my easy_dc algorithm and very first rust program.

A hamiltonian completion solver

Thesis write-up

Calculate Latitude/Longitude coordinates of the vertices of any Platonic Solid, rotated to any 3D orientation within its encapsulating circumsphere.

Algorithms in Bioinformatics with Prof Eskin and Prof Ernst.