Dinamiskās programmēšanas uzdevumu risināšanas shēmas
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Bakalaura darbā tiek apskatīti dinamiskās programmēšanas uzdevumi un to risināšanas metodes. Dinamiskās programmēšanas pamatideja ir aprakstīta analizējot uzdevumus par īsāko ceļu plašā nozīmē (tai skaitā par ceļu ar minimālu garumu, ceļu ar minimālām izmaksām, minimālā riska ceļu, utt.). Īsākā ceļa uzdevumu risināšanā tiek izmantoti divu veidu algoritmi: Floida algoritms un Dijkstras algoritms.
In the Bachelor’s Paper dynamical programming problems and methods how to solve them are described. The basic idea of dynamical programming is described by analyzing the shortest path problems on a wide meaning (int. al. the road with minimal length, the road with minimal costs, the minimal risk road, etc.). For solving the shortest path problem two kinds of algorithms are used: Floyd’s algorithm and Dijkstra’s algorithm.
In the Bachelor’s Paper dynamical programming problems and methods how to solve them are described. The basic idea of dynamical programming is described by analyzing the shortest path problems on a wide meaning (int. al. the road with minimal length, the road with minimal costs, the minimal risk road, etc.). For solving the shortest path problem two kinds of algorithms are used: Floyd’s algorithm and Dijkstra’s algorithm.