There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
This is program that uses Dijkstra algorithm in order to find shortest connection in public transport network implemented as directed graph with time as edges weight. Program also enable to find Hamilton cycle resolving "Travelling salesman problem" using Simulated annealing algorithm.
