Skip to content

dmitryv/trains

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits

.gitignore

.gitignore

 
 

README.md

README.md

 
 

map.py

map.py

 
 

queue.py

queue.py

 
 

test.py

test.py

 
 

trains.py

trains.py

 
 

Repository files navigation

First of all, I define all distances in the map a positive integer by default.

There're two kind of questions:

1. calculate distance(Question: 1, 2, 3, 4, 5)

Just calculate it step by step and return NO SUCH ROUTE when a node is unreachable.

2. shortest route(Question: 8, 9) and number of trips(Question: 6, 7, 10)

Both of them are typical search-releated question. Both BFS and DFS works and I choose BFS.

Usage

Run code to solve the problem

> cd trains
> python3 trains.py

Run UnitTest

> cd trains
> python3 test.py

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages