The single-source shortest paths algorithms and the dynamic programming

A tétel rövid nézete
dc.contributor.authorKátai, Zoltán
dc.date.accessioned2024-09-04T09:46:03Z
dc.date.available2024-09-04T09:46:03Z
dc.date.issued2008-12-31
dc.description.abstractIn this paper we are going to present a teaching—learning method that help students look at three single-source shortest paths graph-algorithms from a so called "upperview": the algorithm based on the topological order of the nodes, the Dijkstra algorithm, the Bellman-Ford algorithm. The goal of the suggested method is, beyond the presentation of the algorithms, to offer the students a view that reveals them the basic and even the slight principal differences and similarities between the strategies. In order to succeed in this object, teachers should present the mentioned algorithms as cousin dynamic programming strategies.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 6 No. ID (2008) , 25-35
dc.identifier.doihttps://doi.org/10.5485/TMCS.2008.R007
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issueID
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379649en
dc.identifier.volume6
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14839
dc.rights.accessOpen Access
dc.rights.ownerZoltán Kátai
dc.subjectoptimal path algorithmsen
dc.subjectgraph theoryen
dc.subjectteaching methodsen
dc.subjectprogramming techniquesen
dc.subjectreporten
dc.titleThe single-source shortest paths algorithms and the dynamic programmingen
dc.typefolyóiratcikkhu
dc.typearticleen
dc.type.detailedidegen nyelvű folyóiratközlemény hazai lapbanhu
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
160.43 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)