| dc.contributor.advisor | Davidrajuh, Reggie | |
| dc.contributor.advisor | Jaiswal, Rituka | |
| dc.contributor.author | Karlsen, Markus Fenne | |
| dc.contributor.author | Ok, Enes | |
| dc.date.accessioned | 2022-06-25T15:51:20Z | |
| dc.date.available | 2022-06-25T15:51:20Z | |
| dc.date.issued | 2022 | |
| dc.identifier | no.uis:inspera:93568650:50869731 | |
| dc.identifier.uri | https://hdl.handle.net/11250/3000852 | |
| dc.description.abstract | Rituka Jaiswal og Reggie Davidrajuh utviklet en graf algoritme for å finne Steiner tre i kodespråket MATLAB . Algoritmen calles Jaiswal & Davidrajuh’s algorithm. Dette prosjektet dreier seg om virkeliggjøring, imple-
mentering and analysering graf algoritmen in Python kodespråket. Først dreier prosjektet seg om å studere steiner tre ,og graf algoritmer for å finne minimums-spannende tre.
Andre delen av bacheloroppagven breskriver vår implementasjon av graf algoritmen i Python kodespråket og teste det med noen eksempler. | |
| dc.description.abstract | Rituka Jaiswal and Reggie Davidrajuh developed a graph algorithm for find-
ing Steiner trees in MATLAB language. The algorithm they made is called
Jaiswal & Davidrajuh’s algorithm. This project deals with realizing, imple-
menting and analyzing that graph algorithm in Python language. Firstly,
this project revolves around a study of Steiner trees and graph algorithms
for finding minimumweight spanning trees. The second part of this bach-
elor thesis describes our implementation of Jaiswal & Davidrajuh’s graph
algorithm in Python language and tests it with examples. | |
| dc.language | eng | |
| dc.publisher | uis | |
| dc.title | Anvendelse av Grafalgoritme i Smart Strømnett | |
| dc.type | Bachelor thesis | |
