Skip to content

A python implementation of Dijkstra's Shortest Path algorithm to address the traveling salesman problem

Notifications You must be signed in to change notification settings

adammikulis/traveling-deliveryman

Repository files navigation

This is a program that applies Dijkstra's Shortest Path algorithm to a package delivery situation. Run main.py, requires Python 3.12

About

A python implementation of Dijkstra's Shortest Path algorithm to address the traveling salesman problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages