Aplikacija za poučavanje metode za traženje najkraćih putova u težinskom grafu

undergraduate thesis

• Author: Katarina Kovačević
• Mentor: Anamari Nakić (mentor)
• Committee member: Anamari Nakić (predsjednik povjerenstva)
• Committee member: Mario Krnić (član povjerenstva)
• Committee member: Lenka Mihoković (član povjerenstva)
• Granter: University of Zagreb; Faculty of Electrical Engineering and Computing; Zagreb
• Defense date and country: 2022-02-08, Croatia
• Scientific / art field, discipline and subdiscipline: TECHNICAL SCIENCES; Computing

Abstract

Algoritmi najkraćih putova koriste se u svakodnevnom životu u svim područjima ljudskog rada i djelovanja. Samo neki od primjera korištenja tih algoritama glase: traženje udaljenosti između polazišta i odredišta na digitalnim kartama, pozivanje na mobitel, internetski protokoli, korištenje određenih značajki na društvenim mrežama, određivanje najkraćih ruta na avionskim letovima itd. Postoji mnogo različitih algoritama, od kojih je najpoznatiji Dijkstrin algoritam. U ovom radu, u programskom jeziku za c#, izrađena je i opisana aplikacija za poučavanje najkraćih putova pomoću Dijkstrinog algoritma. Cilj je olakšati svladavanje Dijkstrinog algoritma studentima, ali zbog jednostavnosti, prikladna je za korištenje i za široku nestručnu zainteresiranu publiku. Također su opisani neki od ostalih bitnijih algoritama za nalaženje najkraćeg puta.

Abstract (english)

Shortest path algorithms are used in everyday life in all areas of human work and activity. A few examples of their usage include: using digital maps to find the shortest path from destination A to destination B, making phone calls, web protocols, using certain social network features, plane flights routing etc. They are many different algorithms, with Dijkstra's algorithm being one of the most famous ones. In this research paper, a C# application for learning Dijkstra's algorithm has been made and explained. The idea behind this application is to make it easier for students to master Dijkstra's algorithm. Due to the fact that it is easy to use, it is not limited to only students, it is also intended for a wider unprofessional audience. In addition, other important shortest path algorithms are named and explained.

• Keywords: algoritam najkraćih putova; Dijkstrin algoritam; teorija grafova; aplikacija za učenje
• Keywords (english): shortest path algorithm; Dijkstra's algorithm; graph theory; learning application
• Language: croatian
• URN:NBN: urn:nbn:hr:168:907044
• Study programme: Title: Computing; Study programme type: university; Study level: undergraduate; Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
• Type of resource: Text
• File origin: Born digital
• Access conditions: Closed access
• Created on: 2023-01-14 09:09:28