This project solves the Traveling Salesman Problem using a genetic algorithm with crossover and mutation of chromosomes. The data is visualized as a graph, using ncurses for the nice old school vibe ! B)
DubiousCactus/GeneticAlgorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of a simple genetic algorithm designed to solve the Traveling Salesman Problem, using ncurses to visualize the graph.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published