/evolution

Minimal Vertex Cover problem solved by using evolutionary programming techniques

Primary LanguageJavaMIT LicenseMIT

Evolutionary algorithm

I wrote this program in Java as a project for my Java and Artificial Intelligence classes. The program tries to solve the Minimal vertex coverage problem on a given map using the evolutionary programming techniques.

Disclaimer

This repository contains code that I wrote when studying Software Engineering at Czech Technical University in Prague.

The objective of these assignments was to write code that works, covers all edge cases, and is somewhat performant. Usually, there were additional rules we had to follow - like limits on the amount of memory our programs could use or that all code needed to be in a single file 🤷‍♂️.

Please keep in mind that I wrote this code years ago and that it was a school assignment. This repository does not serve as the best example of my coding skills.

How to run the program

To run the program, run "PJV-Evolution.jar" file in the "build" folder. Folder "build/maps" contains all the maps the evolution can run on.

Documentation

The documentation can be found in the "build/javadoc" folder.

Source code

The source code is located in the "code" folder.