Skip to content
/ metroMap Public

Simple application meant to demonstrate Dijkstra algorithm

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

MicAPic/metroMap

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits

.gitignore

.gitignore

 
 

README.md

README.md

 
 

algorithm.py

algorithm.py

 
 

app.py

app.py

 
 

init.py

init.py

 
 

metro_icon.png

metro_icon.png

 
 

metro_map.png

metro_map.png

 
 

metro_map_bw.png

metro_map_bw.png

 
 

requirements.txt

requirements.txt

 
 

Repository files navigation

metroMap

Project name: metroMap

Author: Michael Pavlov (SPbU)

A simple application meant to demonstrate Dijkstra algorithm in SPb metro

How to use:

  1. Start up app.py, a window will pop up
  2. Type in two station ids to see the shortest route between them

All of the images used are owned by their respective creators

About

Simple application meant to demonstrate Dijkstra algorithm

Topics

metro saint-petersburg dijkstra-algorithm

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages