diplomsko delo
Sanja Kličković (Author), Luka Fürst (Mentor)

Abstract

V diplomski nalogi predstavljamo interaktivno aplikacijo, ki vizualizira delovanje nekaterih algoritmov za iskanje najkrajših poti na grafih. Iz precej širokega nabora algoritmov smo izbrali Dijkstrov, Bellman-Fordov, Floyd-Warshallov, D'Esopo-Papeov in Fredman-Tarjanov algoritem. V besedilu teoretično predstavljamo njihovo delovanje in uporabo na različnih področjih, navajamo pa tudi njihovo psevdokodo. Predstavljamo tudi delovanje aplikacije in primere delovanja za posamezne algoritme. Aplikacijo smo izdelali kot didaktički pripomoček, namenjen tako učiteljem kot študentom.

Keywords

vizualizacija;algoritem;graf;najkrajša pot;iskanje poti v grafu;Dijkstra;Bellman-Ford;Floyd-Warshall;D'Esopo-Pape;Fredman-Tarjan;didaktički pripomoček;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [S. Kličković]
UDC: 004(043.2)
COBISS: 53043715 Link will open in a new window
Views: 775
Downloads: 104
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Visualization of algorithms for finding shortest paths in graphs
Secondary abstract: In this diploma thesis, we present an interactive application for visualizing algorithms for finding shortest paths in graphs. From a fairly large set of algorithms, we selected the Dijkstra, Bellman-Ford, Floyd-Warshall, D'Esopo-Pape, and Fredman-Tarjan algorithm. We describe them informally and in pseudocode. Tha application was designed as a didactic tool, both for teachers and for students.
Secondary keywords: visualization;algorithm;graph;shortest path;finding path in graph;Dijkstra;Bellman-Ford;Floyd-Warshall;D'Esopo-Pape;Fredman-Tarjan;didactic tool;computer and information science;diploma;
Type (COBISS): Bachelor thesis/paper
Study programme: 1000468
Embargo end date (OpenAIRE): 1970-01-01
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 78 str.
ID: 12582848