Application of floyd's algorithm on transport network of south bohemian region
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F16%3A39902296" target="_blank" >RIV/00216275:25510/16:39902296 - isvavai.cz</a>
Alternative codes found
RIV/75081431:_____/16:00000696
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Application of floyd's algorithm on transport network of south bohemian region
Original language description
The introductory part of the paper deals with the theory of searching for optimal routes in transport networks, including a description of each type of optimization tasks. The aim of the article is demonstration of Floyd algorithm application to find the minimal paths from each node to another in network graph - in our case the network represents traffic model of road network in the region of South Bohemia.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
AE - Management, administration and clerical work
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Komunikácie: Communications (Scientific Letters of the University of Žilina)
ISSN
1335-4205
e-ISSN
—
Volume of the periodical
18
Issue of the periodical within the volume
2
Country of publishing house
SK - SLOVAKIA
Number of pages
4
Pages from-to
68-71
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-84965056835