| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Primeri uporabe pregleda grafov v globino : na študijskem programu 2. stopnje Matematika
Authors:ID Galun, Maša (Author)
ID Taranenko, Andrej (Mentor) More about this mentor... New window
Files:.pdf MAG_Galun_Masa_2025.pdf (512,75 KB)
MD5: BE2456D079BA8A71C54BAC5BC5A44186
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V magistrski nalogi predstavimo različne algoritme, ki temeljijo na pregledu grafov v globino (DFS). Delovanje DFS algoritma prikažemo na problemih iz teorije grafov in teorije iger. Predstavimo osnovne pojme teorije grafov in analiziramo delovanje ter časovno zahtevnost DFS algoritma.Definiramo pojem krepke povezanosti in krepko povezanih komponent. Obravnavamo dva algoritma za iskanje krepko povezanih komponent v usmerjenih grafih (Kosaraju-Sharirjev in Tarjanov algoritem), ki ju implementiramo v programskem jeziku Python. V zadnjem poglavju preučujemo uporabo DFS algoritma v teoriji iger. Predstavimo minimax algoritem, ki se uporablja za določanje optimalne poteze v igrah z dvema igralcema in ga optimiziramo z alfa-beta obrezovanjem. Predstavljeno implementiramo v programskem jeziku Python, kjer analiziramo delovanje algoritmov na primeru igre križci in krožci.
Keywords:DFS, krepka povezanost, Tarjanov algoritem, Kosaraju-Sharirjev algoritem, minimax, alfa-beta obrezovanje, teorija iger, Python.
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[M. Galun]
Year of publishing:2025
Number of pages:VIII, 51 f.
PID:20.500.12556/DKUM-93223 New window
UDC:519.17(043.2)
COBISS.SI-ID:242077187 New window
Publication date in DKUM:10.07.2025
Views:213
Downloads:112
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:10.07.2025

Secondary language

Language:English
Title:Use cases of depth first search in graphs : magistrsko delo
Abstract:In this master’s thesis, we present various algorithms based on the depth-first search (DFS). The functioning of the DFS algorithm is demonstrated through problems from graph theory and game theory. We introduce the fundamental concepts of graph theory and analyze the functionality and the time complexity of the DFS algorithm. We define the concept of strong connectivity and strongly connected components. We examine two algorithms for finding strongly connected components in directed graphs (the Kosaraju-Sharir and Tarjan algorithms), both of which are implement in Python. In the final chapter, we explore the application of the DFS algorithm in game theory. We present the minimax algorithm, which is used to determine an optimal move in two-player games, and optimize it using alpha-beta pruning. The approach is implemented in Python, where we analyze the algorithm's performance using the example of the game tic-tac-toe.
Keywords:DFS, strong connectivity, Kosaraju-Sharir algorithm, Tarjan algorithm, minimax, alpha-beta pruning, game theory, Python.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica