Nejkratší cesty při vyhledávání dopravního spojení
We deal with algorithms for finding cheapest connections in a transportation network with timetables where a cheapest connection is one with the lowest value given some evaluation function. A problem of cheapest connection in a transportation network is introduced and formalized, and is reduced to a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2007
|
| Online Access: | http://www.nusl.cz/ntk/nusl-289131 |